Bounds on the separation of two parallel disk models

Authors:
Chris Armen
Affiliations:
Department of Computer Science, University of Hartford, 200 Bloomfield Avenue, W. Hartford, CT
Venue:
Proceedings of the fourth workshop on I/O in parallel and distributed systems: part of the federated computing research conference
Year:
1996

Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories

Acta Informatica
How to share memory in a distributed system

Journal of the ACM (JACM)
The input/output complexity of sorting and related problems

Communications of the ACM
A complexity theory of efficient parallel algorithms

Theoretical Computer Science - Special issue: Fifteenth international colloquium on automata, languages and programming, Tampere, Finland, July 1988
General purpose parallel architectures

Handbook of theoretical computer science (vol. A)
Virtual memory for data-parallel computing

Virtual memory for data-parallel computing
An 0(n log n) sorting network

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Fast concurrent access to parallel disks

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Asynchronous scheduling of redundant disk arrays

Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
External memory algorithms and data structures: dealing with massive data

ACM Computing Surveys (CSUR)
External memory algorithms

Handbook of massive data sets
Asynchronous Scheduling of Redundant Disk Arrays

IEEE Transactions on Computers
Algorithms and data structures for external memory

Foundations and Trends® in Theoretical Computer Science

Hi-index	0.00