Fast and optimal simulations between CRCW PRAMs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4170917 (Why is no real title available?)
- scientific article; zbMATH DE number 17533 (Why is no real title available?)
- scientific article; zbMATH DE number 176751 (Why is no real title available?)
- scientific article; zbMATH DE number 177852 (Why is no real title available?)
- scientific article; zbMATH DE number 177853 (Why is no real title available?)
- A guided tour of Chernoff bounds
- A universal interconnection pattern for parallel computers
- An O(logn) parallel connectivity algorithm
- Erratum and addendum to: parallel computation and conflicts in memory access
- Faster optimal parallel prefix sums and list ranking
- Finding the maximum, merging, and sorting in a parallel computation model
- Improved deterministic parallel integer sorting
- Optimal parallel algorithms on planar graphs
- Parallel computation and conflicts in memory access
- Probabilistic Parallel Algorithms for Sorting and Selection
- Relations between Concurrent-Write Models of Parallel Computation
- Simulations among concurrent-write PRAMs
Cited in
(10)- Achieving optimal CRCW PRAM fault-tolerance
- Processor-time tradeoffs in PRAM simulations
- scientific article; zbMATH DE number 17533 (Why is no real title available?)
- The log-star revolution
- Time lower bounds do not exist for CRCW PRAMs
- \(O (\log^* n)\) algorithms on a Sum-CRCW PRAM
- An efficient CCM KRISHNA for high contention environment and its performance comparison with WDL
- On a compaction theorem of Ragde
- Retrieval of scattered information by EREW, CREW and CRCW PRAMs
- Fast rehashing in PRAM emulations
This page was built for publication: Fast and optimal simulations between CRCW PRAMs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096768)
