Arvin Park

发表

Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers

Charles U. Martel, Arvin Park, Ramesh Subramonian, 1992, SIAM J. Comput..

Discussion of previous paper [Repowering of slough estates for optimum energy conversion]

Arvin Park, Dennis Clifford, Rodney F. W. Coates, 1980 .

Address compression through base register caching

Arvin Park, Matthew K. Farrens, 1990, MICRO.

Using color-image maps to study collisions in the three-body problem

Arvin Park, Jonathan W. Brandt, 2005, The Visual Computer.

General asynchrony is not expensive for PRAMs

Charles U. Martel, Arvin Park, Jeffrey C. Becker, 1991, [1991] Proceedings. The Fifth International Parallel Processing Symposium.

An analysis of the information content of address reference streams

Arvin Park, Matthew K. Farrens, Jeffrey C. Becker, 1991, MICRO 24.

Modifying VM hardware to reduce address pin requirements

Arvin Park, Gary S. Tyson, Matthew Farrens, 1992, MICRO 1992.

A partitioned translation lookaside buffer approach to reducing address bandwith (abstract)

Arvin Park, Matthew Farrens, Rob Fanfelle, 1992, ISCA '92.

Address compression through base register caching

Arvin Park, Matthew Farrens, 1990, [1990] Proceedings of the 23rd Annual Workshop and Symposium@m_MICRO 23: Microprogramming and Microarchitecture.

The Processor Identity Problem

Arvin Park, Richard J. Lipton, R. Lipton, 1990, Inf. Process. Lett..

Measurements of the paging behavior of UNIX

Arvin Park, Jeffrey C. Becker, 1991, SIGMETRICS '91.

Reducing Communication Costs for Sorting on Mesh-Connected and Linearly Connected Parallel Computers

Arvin Park, Krishnaswamy Balasubramanian, 1990, J. Parallel Distributed Comput..

CCHIME: a cache coherent hybrid interconnected memory extension

Allison Woodruff, Arvin Park, Matthew K. Farrens, 1992, Proceedings Sixth International Parallel Processing Symposium.

An analysis of the information content of address and data reference streams

Arvin Park, Jeffrey C. Becker, 1993, SIGMETRICS '93.

Dynamic Base Register Caching: A Technique for Reducing Address Bus Width

Arvin Park, Matthew K. Farrens, M. Farrens, 1991, ISCA.

IOStone: a synthetic file system benchmark

Arvin Park, Richard J. Lipton, Jeffrey C. Becker, 1990, CARN.

Modifying VM hardware to reduce address pin requirements

Arvin Park, Gary S. Tyson, Matthew K. Farrens, 1992, MICRO.

Codes to reduce switching transients across VLSI I/O pins

Arvin Park, Ron Maeder, 1992, CARN.

Array Access Bounds for Block Storage Memory Systems

Arvin Park, Richard J. Lipton, Krishnaswamy Balasubramanian, 1989, IEEE Trans. Computers.

A variable rate strategy for retrieving audio data from secondary storage

Arvin Park, Peter English, 1991 .

Dynamic base register caching: a technique for reducing address bus width

Arvin Park, Matthew Farrens, M. Farrens, 1991, [1991] Proceedings. The 18th Annual International Symposium on Computer Architecture.

A Partitioned Translation Lookaside Buffer Approach to Reducing Address Bandwidth

Arvin Park, Gary S. Tyson, Matthew Farrens, 1992, [1992] Proceedings the 19th Annual International Symposium on Computer Architecture.

Workload and implementation considerations for dynamic base register caching

Arvin Park, Matthew K. Farrens, 1991, MICRO 24.

Improved sorting algorithms for parallel computers

Arvin Park, Krishnaswamy Balasubramanian, 1987, CSC '87.

A partitioned translation lookaside buffer approach to reducing address bandwith

Arvin Park, Gary S. Tyson, Matthew K. Farrens, 1992, ISCA.

Analysis of the paging behavior of UNIX

Arvin Park, Jeffrey C. Becker, 1991, PERV.

Performance through memory

Arvin Park, Hector Garcia-Molina, Lawrence R. Rogers, 1987, SIGMETRICS '87.