Efficient algorithms for list ranking and for solving graph problems on the hypercube

Journal Article · Mon Jan 01 00:00:00 EST 1990 · IEEE Transactions on Parallel and Distributed Systems; (USA)

DOI:https://doi.org/10.1109/71.80127· OSTI ID:6397898

Ryu, K W; Jaja, J ^[1]

---

1. Inst. for Advanced Computer Studies, Univ. of Maryland, College Park, MD (US)

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 + f}), for any constant f {gt} 0, and in time O(n log n/p + log{sup 3} p) otherwise. This clearly attains a linear speed-up when n = {omega}(p{sup 1 + f}). Efficient balancing and routing schemes had to be used to achieve the linear speed-up. 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.

• OSTI ID: 6397898
• Journal Information: IEEE Transactions on Parallel and Distributed Systems; (USA), Vol. 1:1; ISSN 1045-9219
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
HYPERCUBE COMPUTERS
ALGORITHMS
PARALLEL PROCESSING
TECHNOLOGY UTILIZATION
GRAPHS
COMPUTERS
MATHEMATICAL LOGIC
PROGRAMMING
990200* - Mathematics & Computers