Relations between Concurrent-Write Models of Parallel Computation
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1215473
- scientific article; zbMATH DE number 2104622
- Theoretical Aspects of Computing - ICTAC 2004
- Models for parallel computations
- Limits on the power of concurrent-write parallel machines
- The relationship between two semantics of parallel computations
- Parallel models of computation: An introductory survey
- scientific article; zbMATH DE number 800569
- scientific article; zbMATH DE number 809425
Cited in
(42)- ERCW PRAMs and optical communication
- Processor-time tradeoffs in PRAM simulations
- Removing Ramsey theory: Lower bounds with smaller domain size
- A theorem on the relation between \(\text{BSR}_k\) and \(\text{BSR}^+\)
- Fault-tolerant sequential scan
- Programmable and parallel water computing
- Optimal parallel detection of squares in strings
- scientific article; zbMATH DE number 177541 (Why is no real title available?)
- Optimal parallel two dimensional text searching on a CREW PRAM
- Optimal parallel algorithms for periods, palindromes and squares (extended abstract)
- More general parallel tree contraction: Register allocation and broadcasting in a tree
- Parallel two dimensional witness computation
- On separating the EREW and CREW PRAM models
- On the power of concurrent-write PRAMs with read-only memory
- Optimal parallel algorithms on planar graphs
- Simple fast parallel hashing
- Sorting strings and constructing digital search trees in parallel
- Collapsing the hierarchy of parallel computational models
- Compression using efficient multicasting
- Simulations among concurrent-write PRAMs
- Principles of Distributed Systems
- Retrieval of scattered information by EREW, CREW, and CRCW PRAMs
- Restricted CRCW PRAMs
- Finding level-ancestors in trees
- Almost fully-parallel parentheses matching
- Efficient PRAM simulation on a distributed memory machine
- Parallel algorithms for separable permutations
- An efficient parallel algorithm for the single function coarsest partition problem
- Methods for message routing in parallel machines
- Parallel models of computation: An introductory survey
- Retrieval of scattered information by EREW, CREW and CRCW PRAMs
- Efficient parallel recognition of some circular arc graphs. I
- Fast and optimal simulations between CRCW PRAMs
- Parallel algorithms for matrix polynomial division
- Optimal Parallel Searching an Array for Certain Repetitions
- Incomparability in parallel computation
- Iterative computations with ordered read-write locks
- Fast parallel Lyndon factorization with applications
- Efficient string matching on packed texts
- Parallel algorithms for red--black trees
- Integer sorting and routing in arrays with reconfigurable optical buses
- More general parallel tree contraction: register allocation and broadcasting in a tree
This page was built for publication: Relations between Concurrent-Write Models of Parallel Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3798244)
