From the Publisher:
Although PRAM (Parallel Random Access Memory) is a well-known topic in parallel computing, its practical application has rarely been explored. This groundbreaking work changes all that. Written by world experts on this technology, it explains how to use PRAM to design algorithms for parallel computers and includes a number of PRAM implementations. Readers can also use the book as a self-study guide to parallel programming in general.
Cited By
- Da Silva J, Leão L, Petrucci V, Gamatié A and Pereira F (2021). Mapping Computations in Heterogeneous Multicore Systems with Statistical Regression on Program Inputs, ACM Transactions on Embedded Computing Systems, 20:6, (1-35), Online publication date: 30-Nov-2021.
- Edwards J and Vishkin U (2021). Study of Fine-grained Nested Parallelism in CDCL SAT Solvers, ACM Transactions on Parallel Computing, 8:3, (1-18), Online publication date: 30-Sep-2021.
- Forsell M, Roivainen J and Leppänen V (2018). REPLICA MBTAC, The Journal of Supercomputing, 74:5, (1911-1933), Online publication date: 1-May-2018.
- Mäkelä J, Forsell M and Leppänen V Compiler assisted dynamic allocation of finite hardware acceleration resources for parallel tasks Proceedings of the 17th International Conference on Computer Systems and Technologies 2016, (49-56)
- Mäkelä J, Leppänen V and Forsell M Towards a parallel debugging framework for the massively multi-threaded, step-synchronous REPLICA architecture Proceedings of the 14th International Conference on Computer Systems and Technologies, (153-160)
- Vishkin U (2011). Using simple abstraction to reinvent computing for parallelism, Communications of the ACM, 54:1, (75-85), Online publication date: 1-Jan-2011.
- Hassaan M, Burtscher M and Pingali K Ordered vs. unordered Proceedings of the 16th ACM symposium on Principles and practice of parallel programming, (3-12)
- Mäkelä J, Leppänen V and Forsell M RISC-based moving threads multicore architecture Proceedings of the 12th International Conference on Computer Systems and Technologies, (51-56)
- Hassaan M, Burtscher M and Pingali K (2011). Ordered vs. unordered, ACM SIGPLAN Notices, 46:8, (3-12), Online publication date: 7-Sep-2011.
- Keceli F, Moreshet T and Vishkin U Thermal management of a many-core processor under fine-grained parallelism Proceedings of the 2011 international conference on Parallel Processing, (249-259)
- Torbert S, Vishkin U, Tzur R and Ellison D Is teaching parallel algorithmic thinking to high school students possible? Proceedings of the 41st ACM technical symposium on Computer science education, (290-294)
- Brown R, Shoop E, Adams J, Clifton C, Gardner M, Haupt M and Hinsbeeck P Strategies for preparing computer science students for the multicore world Proceedings of the 2010 ITiCSE working group reports, (97-115)
- Paakkulainen J, Mäkelä J, Leppänen V and Forsell M Outline of RISC-based core for multiprocessor on chip architecture supporting moving threads Proceedings of the International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing, (1-6)
- Mäkelä J, Paakkulainen J and Leppänen V MVTsim Proceedings of the International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing, (1-6)
- Hoffmann R The GCA-w Massively Parallel Model Proceedings of the 10th International Conference on Parallel Computing Technologies, (194-206)
- Wen X and Vishkin U Fpga-based prototype of a pram-on-chip processor Proceedings of the 5th conference on Computing frontiers, (55-66)
- Ålind M, Eriksson M and Kessler C BlockLib Proceedings of the 1st international workshop on Multicore software engineering, (7-14)
- Snyder L The design and development of ZPL Proceedings of the third ACM SIGPLAN conference on History of programming languages, (8-1-8-37)
- Forsell M Reducing the associativity and size of step caches in CRCW operation Proceedings of the 20th international conference on Parallel and distributed processing, (261-261)
- Kessler C (2004). A practical access to the theory of parallel algorithms, ACM SIGCSE Bulletin, 36:1, (397-401), Online publication date: 1-Mar-2004.
- Kessler C A practical access to the theory of parallel algorithms Proceedings of the 35th SIGCSE technical symposium on Computer science education, (397-401)
- Forsell M A parallel computer as a NOC region Networks on chip, (173-192)
- Forsell M (2002). Architectural differences of efficient sequential and parallel computers, Journal of Systems Architecture: the EUROMICRO Journal, 47:13, (1017-1041), Online publication date: 1-Jul-2002.
Recommendations
Work-Time Optimal k-Merge Algorithms on the PRAM
For 2 k n, the k-merge problem is to merge a collection of k sorted sequences of total length n into a new sorted sequence. The k-merge problem is fundamental as it provides a common generalization of both merging and sorting. The main contribution of ...
Parallel Heap Operations on an EREW PRAM
We consider parallel heap operations on the exclusive-read exclusive-write parallel random-access machine. We first present an O(n/p + log p) time parallel algorithm to construct a heap of n elements using p processors, which is optimal for p (n/log n). ...