Type architectures, shared memory, and the corollary of modest potential
Annual review of computer science vol. 1, 1986
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
The APRAM: incorporating asynchrony into the PRAM model
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Communication complexity of PRAMs
Theoretical Computer Science - Special issue: Fifteenth international colloquium on automata, languages and programming, Tampere, Finland, July 1988
A bridging model for parallel computation
Communications of the ACM
Vector models for data-parallel computing
Vector models for data-parallel computing
Asynchronous shared memory parallel computation
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
General purpose parallel architectures
Handbook of theoretical computer science (vol. A)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Designing broadcasting algorithms in the postal model for message-passing systems
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
LogP: towards a realistic model of parallel computation
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Optimal broadcast and summation in the LogP model
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
An atomic model for message-passing
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Contention in shared memory algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Direct bulk-synchronous parallel algorithms
Journal of Parallel and Distributed Computing
Trade-offs between communication throughput and parallel time
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A research agenda for high performance computing software
Developing a computer science agenda for high-performance computing
Accounting for memory bank contention and delay in high-bandwidth multiprocessors
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Fully dynamic search trees for an extension of the BSP model
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Communication-efficient parallel sorting (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A quantitative comparison of parallel computation models
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Efficient low-contention parallel algorithms
Journal of Computer and System Sciences
Can shared-memory model serve as a bridging model for parallel computation?
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Modeling parallel bandwidth: local vs. global restrictions
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Computational bounds for fundamental problems on general-purpose parallel models
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
The queue-read queue-write asynchronous PRAM model
Theoretical Computer Science - Special issue on parallel computing
ERCW PRAMs and optical communication
Theoretical Computer Science - Special issue on parallel computing
The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms
SIAM Journal on Computing
Emulations between QSM, BSP, and LogP: a framework for general-purpose parallel algorithm design
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Experimental Evaluation of QSM, a Simple Shared-Memory Model
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
Scheduling Parallel Communication: The h-relation Problem
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest
ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
The E-BSP Model: Incorporating General Locality and Unbalanced Communication into the BSP Model
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing-Volume II
A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Models of parallel computation: a survey and synthesis
HICSS '95 Proceedings of the 28th Hawaii International Conference on System Sciences
Parallelism in random access machines
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Fluent parallel computation
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Clock construction in fully asynchronous parallel systems and PRAM simulation
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
| Hi-index | 0.00 |
We describe the Queuing Shared-Memory (QSM) and Bulk-Synchronous Parallel (BSP) models of parallel computation. The former is shared-memory and the latter is distributed-memory. Both models use the 'bulk-synchronous' paradigm introduced by the BSP model. We describe the relationship of these two models to each other and to the 'LogP' model, and give an overview of algorithmic results on these models.