default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid T. Harper III
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 1996
[j10]Jong Won Park, David T. Harper III:
An Efficient Memory System for the SIMD Construction of a Gaussian Pyramid. IEEE Trans. Parallel Distributed Syst. 7(8): 855-860 (1996)- 1995
- [j9]Douglas W. Miller, David T. Harper III:
Performance analysis of disk cache write policies. Microprocess. Microsystems 19(3): 121-130 (1995) - [j8]Whoi-Yul Kim, Poras T. Balsara, David T. Harper III, Jon Wong Park:
Hierarchy embedded differential image for progressive transmission using lossless compression. IEEE Trans. Circuits Syst. Video Technol. 5(1): 1-13 (1995) - 1994
- [j7]David T. Harper III:
A Multiaccess Frame Buffer Architecture. IEEE Trans. Computers 43(5): 618-622 (1994) - 1993
- [j6]David T. Harper III, Yashodara Costa:
Analytical Estimation of Vector Access Performance in Parallel Memory Architectures. IEEE Trans. Computers 42(5): 616-624 (1993) - 1992
- [j5]David T. Harper III:
Increased Memory Performance During Vector Accesses Through the use of Linear Address Transformations. IEEE Trans. Computers 41(2): 227-230 (1992) - 1991
- [j4]David T. Harper III, Darel A. Linebarger:
Conflict-Free Vector Access Using a Dynamic Storage Scheme. IEEE Trans. Computers 40(3): 276-283 (1991) - [j3]David T. Harper III:
Block, Multistride Vector, and FFT Accesses in Parallel Memory Systems. IEEE Trans. Parallel Distributed Syst. 2(1): 43-51 (1991) - 1990
- [j2]David T. Harper III, J. Robert Jump:
Evaluation of Reduced Bandwidth Multistage Networks. J. Parallel Distributed Comput. 9(3): 304-311 (1990) - 1987
- [j1]David T. Harper III, J. Robert Jump:
Vector Access Performance in Parallel Memories Using a Skewed Storage Scheme. IEEE Trans. Computers 36(12): 1440-1449 (1987)
Conference and Workshop Papers
- 1993
- [c9]David T. Harper III, David Tuma:
A Parallel Algorithm for Cache Miss Ratio Evaluation. MASCOTS 1993: 79-82 - 1992
- [c8]Jong Won Park, David T. Harper III:
Memory Architecture Support for the SIMD Construction of a Gaussian Pyramid. SPDP 1992: 444-451 - 1991
- [c7]David T. Harper III:
Reducing Memory Contention in Shared Memory Multiprocessors. ISCA 1991: 66-73 - 1989
- [c6]David T. Harper III:
Address Transformations to Increase Memory Performance. ICPP (1) 1989: 237-241 - [c5]David T. Harper III, Darel A. Linebarger:
A Dynamic Storage Scheme for Conflict-Free Vector Access. ISCA 1989: 72-77 - 1988
- [c4]David T. Harper III, Darel A. Linebarger:
Storage Schemes for Efficient Computation of a Radix 2 FFT in a Machine with Parallel Memories. ICPP (1) 1988: 422-425 - 1987
- [c3]David T. Harper III, J. Robert Jump:
Performance Evaluation of Reduced Bandwidth Multistage Interconnection Networks. ISCA 1987: 171-175 - 1986
- [c2]David T. Harper III, J. Robert Jump:
Performance Evaluation of Vector Accesses in Parallel Memories Using a Skewed Storage Scheme. ISCA 1986: 324-328 - 1984
- [c1]J. Robert Jump, James D. Wise, David T. Harper III:
An interleaved array-processing architecture. AFIPS National Computer Conference 1984: 93-100
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
