The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms
From MaRDI portal
Publication:4210175
DOI10.1137/S009753979427491zbMath0914.68069MaRDI QIDQ4210175
Phillip B. Gibbons, Vijaya Ramachandran, Yossi Matias
Publication date: 21 September 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Related Items
Parallel Algorithms for Colouring Vertices of Graph Using Bit Manipulation ⋮ Delayed path coupling and generating random permutations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient low-contention parallel algorithms
- The queue-read queue-write asynchronous PRAM model
- ERCW PRAMs and optical communication
- Exact lower time bounds for computing Boolean functions on CREW PRAMs
- On the cost-effectiveness of PRAMs
- Retrieval of scattered information by EREW, CREW, and CRCW PRAMs
- Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
- Parallel Prefix Computation
- Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers
- Contention in shared memory algorithms
- An Optical Simulation of Shared Memory
- Probability Inequalities for Sums of Bounded Random Variables