Parallel computation and conflicts in memory access
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3576688 (Why is no real title available?)
- scientific article; zbMATH DE number 3449757 (Why is no real title available?)
- Corrigendum: A fast stable sorting algorithm with absolutely minimum storage
- Finding the maximum, merging, and sorting in a parallel computation model
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Parallel Algorithms in Graph Theory: Planarity Testing
- Parallelism in random access machines
- Some Complexity Results for Matrix Computations on Parallel Processors
Cited in
(43)- Processor-time tradeoffs in PRAM simulations
- Removing Ramsey theory: Lower bounds with smaller domain size
- Towards optimal parallel bucket sorting
- A parallel bucket sort
- Parallel approximation of optimization problems
- Computing dominators in parallel
- Fast parallel graph searching with applications
- Simulating the CRCW PRAM on reconfigurable networks
- Computing OR on a randomized fixed adversary CRCW PRAM
- FAST PARALLEL ALGORITHMS FOR FINDING CUTPOINTS AND BRIDGES OF UNDIRECTED GRAPHS
- FINDING CENTERS AND MEDIANS OF GRAPHS IN PARALLEL
- PARALLEL BLOCK-FINDING USING DISTANCE MATRICES
- An 0(log n) parallel algorithm for strong connectivity augmentation problem
- On the Parallel Evaluation of Dwba Integrals
- A complexity theory of efficient parallel algorithms
- A parallel algorithm for surface-based object reconstruction
- Parallel random access machines with bounded memory wordsize
- On efficient parallel computations for some dynamic programming problems
- Simulations among concurrent-write PRAMs
- Constant-time parallel recognition of split graphs
- New fast parallel algorithm for the connected component problem and its VLSI implementation
- Parallel computation of perfect elimination schemes using partition techniques on triangulated graphs
- Reducing conflict resolution time for solving graph problems in broadcast communications
- Parallel vertex colouring of interval graphs
- Finding maximum matching for bipartite graphs in parallel
- An adaptive and cost-optimal parallel algorithm for minimum spanning trees
- Approximating minimum weight perfect matchings for complete graphs satisfying the triangle inequality
- Limits on the power of concurrent-write parallel machines
- Expected parallel time and sequential space complexity of graph and digraph problems
- Fast sequential and parallel algorithms for finding extremal sets
- Coloring k-colorable graphs in constant expected parallel time
- Fast and optimal simulations between CRCW PRAMs
- Large parallel machines can be extremely slow for small problems
- Fast parallel heuristics for the job shop scheduling problem
- Computing transitive closure on systolic arrays of fixed size
- On the complexity of the recognition of parallel 2D-image languages
- Incomparability in parallel computation
- Relating the power of the multiple associative computing (MASC) model to that of reconfigurable bus-based models
- Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC
- Parallel computations on graphs
- An improved parallel algorithm for integer GCD
- A new class of parallel algorithms for finding connected components on machines with bit-vector operations
- Two dimensional processor array with a reconfigurable bus system is at least as powerful as CRCW model
This page was built for publication: Parallel computation and conflicts in memory access
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1171382)
