Fast parallel algorithms for finding Hamiltonian paths and cycles in a tournament
Journal of Algorithms
Efficient parallel algorithms
Optimal computation of prefix sums on a binary tree of processors
International Journal of Parallel Programming
A bridging model for parallel computation
Communications of the ACM
Special purpose parallel computing
Lectures on parallel computation
Communication-efficient parallel sorting (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Parallel computation: models and methods
Parallel computation: models and methods
Finding a Hamiltonian paths in tournaments on clusters - a provably communication-efficient approach
Proceedings of the 2001 ACM symposium on Applied computing
Synthesis of Parallel Algorithms
Synthesis of Parallel Algorithms
Analysis and Design of Parallel Algorithms: Arithmetic and Matrix Problems
Analysis and Design of Parallel Algorithms: Arithmetic and Matrix Problems
| Hi-index | 0.01 |
This paper presents a general methodology for the communication-efficient parallelization of graph algorithms using the divide-and-conquer approach. The algorithm is communication-free in the conquer stage and uses only a small amount of messages while partitioning the input. Specifically, a practical parallel algorithm with full scalability, based on the BSP model, for finding Hamiltonian paths in tournaments is presented.Experiments have been carried out on two architecturally different systems, which stand for the possible site variety of a computational grid. These include a distributed-memory system: a Solaris cluster of 32 Sun Ultra5 computers on Myrinet network and a distributed shared-memory system: an SGI Origin 2000 with 32 R10000 processors, using MPICH-GM and MPT, respectively. Both implementations are compatible with the grid-enabled MPI implementation, MPICH-G2.