Arvin Park

21 papers A* 10Journal 8Unranked 3
YearRankTypeTitle / Venue / Authors
1993 A* conf
An Analysis of the Information Content of Address and Data Reference Streams.
SIGMETRICS
Jeffrey C. Becker, Arvin Park
1992 A* conf
A partitioned translation lookaside buffer approach to reducing address bandwith.
ISCA
Matthew K. Farrens, Arvin Park, Rob Fanfelle, Pius Ng, Gary S. Tyson
1992 — conf
CCHIME: A Cache Coherent Hybrid Interconnected Memory Extension.
IPPS
Matthew K. Farrens, Arvin Park, Allison Woodruff
1992 J jnl
Codes to reduce switching transients across VLSI I/O pins.
SIGARCH Comput. Archit. News
Arvin Park, Ron Maeder
1992 A* conf
Modifying VM hardware to reduce address pin requirements.
MICRO
Matthew K. Farrens, Arvin Park, Gary S. Tyson
1992 J jnl
Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers.
SIAM J. Comput.
Charles U. Martel, Arvin Park, Ramesh Subramonian
1991 A* conf
An Analysis of the Information Content of Address Reference Streams.
MICRO
Jeffrey C. Becker, Arvin Park, Matthew K. Farrens
1991 J jnl
Analysis of the Paging Behavior of UNIX.
SIGMETRICS Perform. Evaluation Rev.
Jeffrey C. Becker, Arvin Park
1991 A* conf
Dynamic Base Register Caching: A Technique for Reducing Address Bus Width.
ISCA
Matthew K. Farrens, Arvin Park
1991 — conf
General Asynchrony Is Not Expensive for PRAMs.
IPPS
Jeffrey C. Becker, Charles U. Martel, Arvin Park
1991 A* conf
Measurements of the Paging Behavior of UNIX.
SIGMETRICS
Arvin Park, Jeffrey C. Becker
1991 J jnl
Using color-image maps to study collisions in the three-body problem.
Vis. Comput.
Jonathan W. Brandt, Arvin Park
1991 A* conf
Workload and Implementation Considerations for Dynamic Base Register Caching.
MICRO
Matthew K. Farrens, Arvin Park
1990 A* conf
Address compression through base register caching.
MICRO
Arvin Park, Matthew K. Farrens
1990 A* conf
Asynchronous PRAMs Are (Almost) as Good as Synchronous PRAMs
FOCS
Charles U. Martel, Ramesh Subramonian, Arvin Park
1990 J jnl
IOStone: a synthetic file system benchmark.
SIGARCH Comput. Archit. News
Arvin Park, Jeffrey C. Becker, Richard J. Lipton
1990 J jnl
Reducing Communication Costs for Sorting on Mesh-Connected and Linearly Connected Parallel Computers.
J. Parallel Distributed Comput.
Arvin Park, Krishnaswamy Balasubramanian
1990 J jnl
The Processor Identity Problem.
Inf. Process. Lett.
Richard J. Lipton, Arvin Park
1989 J jnl
Array Access Bounds for Block Storage Memory Systems.
IEEE Trans. Computers
Arvin Park, Krishnaswamy Balasubramanian, Richard J. Lipton
1987 — conf
Improved sorting algorithms for parallel computers.
ACM Conference on Computer Science
Arvin Park, Krishnaswamy Balasubramanian
1987 A* conf
Performance Through Memory.
SIGMETRICS
Hector Garcia-Molina, Arvin Park, Lawrence R. Rogers