The queue-read queue-write asynchronous PRAM model
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 107951 (Why is no real title available?)
- scientific article; zbMATH DE number 1256650 (Why is no real title available?)
- scientific article; zbMATH DE number 1142306 (Why is no real title available?)
- Asynchronous shared memory search structures
- Contention in shared memory algorithms
- Efficient low-contention parallel algorithms
- Exact lower time bounds for computing Boolean functions on CREW PRAMs
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
- On the Number of Stable States in a NOR Network
- Optimal bounds for decision problems on the CRCW PRAM
- Parallel Merge Sort
- Primitives for asynchronous list compression
- Probabilistic Parallel Algorithms for Sorting and Selection
- Sorting in \(c \log n\) parallel steps
- The expected advantage of asynchrony
- The queue-read queue-write asynchronous PRAM model
- Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers
Cited in
(4)
This page was built for publication: The queue-read queue-write asynchronous PRAM model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1128706)