Incomparability in parallel computation
From MaRDI portal
Recommendations
- On the power of concurrent-write PRAMs with read-only memory
- Relations between Concurrent-Write Models of Parallel Computation
- Separation and lower bounds for ROM and nondeterministic models of parallel computation
- Processor-time tradeoffs in PRAM simulations
- The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$
Cites work
- A universal interconnection pattern for parallel computers
- An O(logn) parallel connectivity algorithm
- Finding the maximum, merging, and sorting in a parallel computation model
- scientific article; zbMATH DE number 3980480 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- Implementation of simultaneous memory address access in models that forbid it
- Intersection Theorems for Systems of Sets
- On Parallel Searching
- Optimal bounds for decision problems on the CRCW PRAM
- Parallel computation and conflicts in memory access
- Simulations among concurrent-write PRAMs
- Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
Cited in
(8)- Separation and lower bounds for ROM and nondeterministic models of parallel computation
- Parallel algorithms for separable permutations
- Transforming comparison model lower bounds to the parallel-random-access-machine
- Collapsing the hierarchy of parallel computational models
- The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$
- On the power of concurrent-write PRAMs with read-only memory
- The strongest model of computation obeying 0-1 Principles
- Large parallel machines can be extremely slow for small problems
This page was built for publication: Incomparability in parallel computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q919822)
