Finding Euler tours in parallel
Journal of Computer and System Sciences
Communications of the ACM - Special section on computer architecture
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Parallel symmetry-breaking in sparse graphs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Communication effect basic linear algebra computations on hypercube architectures
Journal of Parallel and Distributed Computing
Towards optimal parallel bucket sorting
Information and Computation
Designing fast and efficient parallel algorithms
Designing fast and efficient parallel algorithms
Parallel ear decomposition search (EDS) and st-numbering in graphs
Theoretical Computer Science
On finding lowest common ancestors: simplification and parallelization
SIAM Journal on Computing
An O(n2 log n) parallel max-flow algorithm
Journal of Algorithms
Efficient parallel algorithms for some graph problems
Communications of the ACM
Optimal Parallel Algorithms on Planar Graphs
AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures
AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures
Optimal Parallel Evaluation of Tree-Structured Computations by Raking
AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures
Tight bounds on the complexity of parallel sorting
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
The Complexity of Parallel Computations
The Complexity of Parallel Computations
A Survey of Parallel Algorithms for Shared-Memory Machines
A Survey of Parallel Algorithms for Shared-Memory Machines
The Block Distributed Memory Model
IEEE Transactions on Parallel and Distributed Systems
Scalable Parallel Implementations of List Ranking on Fine-Grained Machines
IEEE Transactions on Parallel and Distributed Systems
List-ranking on interconnection networks
Information and Computation
Research note: Parallel algorithms for tree accumulations
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
A hypercube algorithm to solve the list ranking problem is presented. Let n be the length of the list, and let p be the number of processors of the hypercube. The algorithm described runs in time O(n/p) when n= Omega (p/sup 1+ epsilon /) for any constant epsilon, and in time O(n log n/p+log/sup 3/ p) otherwise. This clearly attains a linear speedup when n= Omega (p/sup 1+ epsilon /). Efficient balancing and routing schemes had to be used to achieve the linear speedup. The authors use these techniques to obtain efficient hypercube algorithms for many basic graph problems such as tree expression evaluation, connected and biconnected components, ear decomposition, and st-numbering. These problems are also addressed in the restricted model of one-port communication.