Performance of parallel spanning tree algorithms on linear arrays of transputers and Unix systems

DOI10.1016/S0167-8191(05)80155-3MaRDI QIDQ1179255zbMATH OpenFDO

Authors Sajal K. Das, Cui-Qing Yang

Publication date 26 June 1992

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0167-8191(05)80155-3

zbMATH Keywords

parallel graph algorithmtransputerUnix

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Minimal spanning trees: An empirical investigation of parallel algorithms
• A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)
• Graph algorithms on a tree-structured parallel computer
• Parallel graph algorithms for hypercube computers
• Improving the efficiency of parallel minimum spanning tree algorithms

Cited in

(2)

• Minimal spanning trees: An empirical investigation of parallel algorithms
• A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)

This page was built for publication: Performance of parallel spanning tree algorithms on linear arrays of transputers and Unix systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1179255)