Search the dblp DataBase
Arvin Park: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Hector Garcia-Molina, Arvin Park, Lawrence R. Rogers
Performance Through Memory. [Citation Graph (1, 0)][DBLP]
SIGMETRICS, 1987, pp:122-131 [Conf] - Arvin Park, Krishnaswamy Balasubramanian
Improved sorting algorithms for parallel computers. [Citation Graph (0, 0)][DBLP]
ACM Conference on Computer Science, 1987, pp:239-244 [Conf] - Charles U. Martel, Ramesh Subramonian, Arvin Park
Asynchronous PRAMs Are (Almost) as Good as Synchronous PRAMs [Citation Graph (0, 0)][DBLP]
FOCS, 1990, pp:590-599 [Conf] - Jeffrey C. Becker, Charles U. Martel, Arvin Park
General Asynchrony Is Not Expensive for PRAMs. [Citation Graph (0, 0)][DBLP]
IPPS, 1991, pp:70-75 [Conf] - Matthew K. Farrens, Arvin Park, Allison Woodruff
CCHIME: A Cache Coherent Hybrid Interconnected Memory Extension. [Citation Graph (0, 0)][DBLP]
IPPS, 1992, pp:573-577 [Conf] - Matthew K. Farrens, Arvin Park
Dynamic Base Register Caching: A Technique for Reducing Address Bus Width. [Citation Graph (0, 0)][DBLP]
ISCA, 1991, pp:128-137 [Conf] - Jeffrey C. Becker, Arvin Park, Matthew K. Farrens
An Analysis of the Information Content of Address Reference Streams. [Citation Graph (0, 0)][DBLP]
MICRO, 1991, pp:19-24 [Conf] - Matthew K. Farrens, Arvin Park
Workload and Implementation Considerations for Dynamic Base Register Caching. [Citation Graph (0, 0)][DBLP]
MICRO, 1991, pp:62-68 [Conf] - Matthew K. Farrens, Arvin Park, Gary S. Tyson
Modifying VM hardware to reduce address pin requirements. [Citation Graph (0, 0)][DBLP]
MICRO, 1992, pp:210-213 [Conf] - Arvin Park, Matthew K. Farrens
Address compression through base register caching. [Citation Graph (0, 0)][DBLP]
MICRO, 1990, pp:193-199 [Conf] - Jeffrey C. Becker, Arvin Park
An Analysis of the Information Content of Address and Data Reference Streams. [Citation Graph (0, 0)][DBLP]
SIGMETRICS, 1993, pp:262-263 [Conf] - Arvin Park, Jeffrey C. Becker
Measurements of the Paging Behavior of UNIX. [Citation Graph (0, 0)][DBLP]
SIGMETRICS, 1991, pp:216-217 [Conf] - Richard J. Lipton, Arvin Park
The Processor Identity Problem. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1990, v:36, n:2, pp:91-94 [Journal] - Arvin Park, Krishnaswamy Balasubramanian
Reducing Communication Costs for Sorting on Mesh-Connected and Linearly Connected Parallel Computers. [Citation Graph (0, 0)][DBLP]
J. Parallel Distrib. Comput., 1990, v:9, n:3, pp:318-322 [Journal] - Charles U. Martel, Arvin Park, Ramesh Subramonian
Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1992, v:21, n:6, pp:1070-1099 [Journal] - Jeffrey C. Becker, Arvin Park
Analysis of the Paging Behavior of UNIX. [Citation Graph (0, 0)][DBLP]
SIGMETRICS Performance Evaluation Review, 1991, v:19, n:2, pp:36-43 [Journal] - Arvin Park, Krishnaswamy Balasubramanian, Richard J. Lipton
Array Access Bounds for Block Storage Memory Systems. [Citation Graph (0, 0)][DBLP]
IEEE Trans. Computers, 1989, v:38, n:6, pp:909-913 [Journal] - Jonathan W. Brandt, Arvin Park
Using color-image maps to study collisions in the three-body problem. [Citation Graph (0, 0)][DBLP]
The Visual Computer, 1991, v:7, n:1, pp:13-18 [Journal]
Search in 0.002secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002