A comparison of shared and nonshared memory models of parallel computation
- 1 April 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the IEEE
- Vol. 79 (4) , 480-487
- https://doi.org/10.1109/5.92042
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Scalable Abstractions for Parallel ProgrammingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A bridging model for parallel computationCommunications of the ACM, 1990
- Cache coherence protocols: evaluation using a multiprocessor simulation modelACM Transactions on Computer Systems, 1986
- Type Architectures, Shared Memory, and the Corollary of Modest PotentialAnnual Review of Computer Science, 1986
- Routing, merging, and sorting on parallel models of computationJournal of Computer and System Sciences, 1985
- Three-Dimensional VLSIJournal of the ACM, 1983
- The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel ComputerIEEE Transactions on Computers, 1983
- Finding the maximum, merging, and sorting in a parallel computation modelJournal of Algorithms, 1981
- UltracomputersACM Transactions on Programming Languages and Systems, 1980
- Parallelism in Comparison ProblemsSIAM Journal on Computing, 1975