Arvin Park

According to our database, Arvin Park authored at least 21 papers between 1987 and 1993.

Collaborative distances:

• Dijkstra number of two.
• Erdős number of three.

1993

An Analysis of the Information Content of Address and Data Reference Streams.

Jeffrey C. Becker, Arvin Park

Proceedings of the 1993 ACM SIGMETRICS conference on Measurement and modeling of computer systems, 1993

1992

Codes to reduce switching transients across VLSI I/O pins.

Arvin Park, Ron Maeder

SIGARCH Comput. Archit. News, 1992

Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers.

Charles U. Martel, Arvin Park, Ramesh Subramonian

SIAM J. Comput., 1992

Modifying VM hardware to reduce address pin requirements.

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

Proceedings of the 25th Annual International Symposium on Microarchitecture, 1992

A partitioned translation lookaside buffer approach to reducing address bandwith.

Matthew K. Farrens, Arvin Park, Rob Fanfelle, Pius Ng, Gary S. Tyson

Proceedings of the 19th Annual International Symposium on Computer Architecture. Gold Coast, 1992

CCHIME: A Cache Coherent Hybrid Interconnected Memory Extension.

Matthew K. Farrens, Arvin Park, Allison Woodruff

Proceedings of the 6th International Parallel Processing Symposium, 1992

1991

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

Jonathan W. Brandt, Arvin Park

Vis. Comput., 1991

Analysis of the Paging Behavior of UNIX.

Jeffrey C. Becker, Arvin Park

SIGMETRICS Perform. Evaluation Rev., 1991

Measurements of the Paging Behavior of UNIX.

Arvin Park, Jeffrey C. Becker

Proceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems, 1991

Workload and Implementation Considerations for Dynamic Base Register Caching.

Matthew K. Farrens, Arvin Park

Proceedings of the 24th Annual IEEE/ACM International Symposium on Microarchitecture, 1991

An Analysis of the Information Content of Address Reference Streams.

Jeffrey C. Becker, Arvin Park, Matthew K. Farrens

Proceedings of the 24th Annual IEEE/ACM International Symposium on Microarchitecture, 1991

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

Matthew K. Farrens, Arvin Park

Proceedings of the 18th Annual International Symposium on Computer Architecture. Toronto, 1991

General Asynchrony Is Not Expensive for PRAMs.

Jeffrey C. Becker, Charles U. Martel, Arvin Park

Proceedings of the Fifth International Parallel Processing Symposium, Proceedings, Anaheim, California, USA, April 30, 1991

1990

IOStone: a synthetic file system benchmark.

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

SIGARCH Comput. Archit. News, 1990

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

Arvin Park, Krishnaswamy Balasubramanian

J. Parallel Distributed Comput., 1990

The Processor Identity Problem.

Richard J. Lipton, Arvin Park

Inf. Process. Lett., 1990

Address compression through base register caching.

Arvin Park, Matthew K. Farrens

Proceedings of the 23rd Annual Workshop and Symposium on Microprogramming and Microarchitecture, 1990

Asynchronous PRAMs Are (Almost) as Good as Synchronous PRAMs

Charles U. Martel, Ramesh Subramonian, Arvin Park

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989

Array Access Bounds for Block Storage Memory Systems.

Arvin Park, Krishnaswamy Balasubramanian, Richard J. Lipton

IEEE Trans. Computers, 1989

1987

Performance Through Memory.

Hector Garcia-Molina, Arvin Park, Lawrence R. Rogers

Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems, 1987

Improved sorting algorithms for parallel computers.

Arvin Park, Krishnaswamy Balasubramanian

Proceedings of the 15th ACM Annual Conference on Computer Science, 1987