- CSB - MetaPress - Google - Bing - Yahoo
 | 1993 | |
|---|---|---|
| c12 |      | Jeffrey C. Becker, Arvin Park: An Analysis of the Information Content of Address and Data Reference Streams. SIGMETRICS 1993: 262-263 |
| 1992 | ||
| j6 | | Charles U. Martel, Arvin Park, Ramesh Subramonian: Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers. SIAM J. Comput. 21(6): 1070-1099 (1992) |
| c11 |  | Matthew K. Farrens, Arvin Park, Allison Woodruff: CCHIME: A Cache Coherent Hybrid Interconnected Memory Extension. IPPS 1992: 573-577 |
| c10 | | Matthew K. Farrens, Arvin Park, Gary S. Tyson: Modifying VM hardware to reduce address pin requirements. MICRO 1992: 210-213 |
| 1991 | ||
| j5 | | Jeffrey C. Becker, Arvin Park: Analysis of the Paging Behavior of UNIX. SIGMETRICS Performance Evaluation Review 19(2): 36-43 (1991) |
| j4 | | Jonathan W. Brandt, Arvin Park: Using color-image maps to study collisions in the three-body problem. The Visual Computer 7(1): 13-18 (1991) |
| c9 | | Jeffrey C. Becker, Charles U. Martel, Arvin Park: General Asynchrony Is Not Expensive for PRAMs. IPPS 1991: 70-75 |
| c8 | | Matthew K. Farrens, Arvin Park: Dynamic Base Register Caching: A Technique for Reducing Address Bus Width. ISCA 1991: 128-137 |
| c7 | | Jeffrey C. Becker, Arvin Park, Matthew K. Farrens: An Analysis of the Information Content of Address Reference Streams. MICRO 1991: 19-24 |
| c6 | | Matthew K. Farrens, Arvin Park: Workload and Implementation Considerations for Dynamic Base Register Caching. MICRO 1991: 62-68 |
| c5 | | Arvin Park, Jeffrey C. Becker: Measurements of the Paging Behavior of UNIX. SIGMETRICS 1991: 216-217 |
| 1990 | ||
| j3 | | Richard J. Lipton, Arvin Park: The Processor Identity Problem. Inf. Process. Lett. 36(2): 91-94 (1990) |
| j2 | | Arvin Park, Krishnaswamy Balasubramanian: Reducing Communication Costs for Sorting on Mesh-Connected and Linearly Connected Parallel Computers. J. Parallel Distrib. Comput. 9(3): 318-322 (1990) |
| c4 | | Charles U. Martel, Ramesh Subramonian, Arvin Park: Asynchronous PRAMs Are (Almost) as Good as Synchronous PRAMs. FOCS 1990: 590-599 |
| c3 | | Arvin Park, Matthew K. Farrens: Address compression through base register caching. MICRO 1990: 193-199 |
| 1989 | ||
| j1 | | Arvin Park, Krishnaswamy Balasubramanian, Richard J. Lipton: Array Access Bounds for Block Storage Memory Systems. IEEE Trans. Computers 38(6): 909-913 (1989) |
| 1987 | ||
| c2 | | Arvin Park, Krishnaswamy Balasubramanian: Improved sorting algorithms for parallel computers. ACM Conference on Computer Science 1987: 239-244 |
| c1 | | Hector Garcia-Molina, Arvin Park, Lawrence R. Rogers: Performance Through Memory. SIGMETRICS 1987: 122-131 |
Colors in the list of coauthors
Last update Fri May 24 02:30:24 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page