Reconfigurable Parallel Sorting and Load Balancing on a Beowulf Cluster: HeteroSort

Authors:
Pamela Yang;Timothy M. Kunau;Bonnie Holte Bennett;Emmett Davis;Bill Wren
Affiliations:
-;-;-;-;-
Venue:
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Year:
2000

Citing 4
Cited 0

Sorting on a mesh-connected parallel computer

Communications of the ACM
Load Balancing in Parallel Computers: Theory and Practice

Load Balancing in Parallel Computers: Theory and Practice
On Balancing Sorting on a Linear Array

IEEE Transactions on Parallel and Distributed Systems
Algorithms and Average Time Bounds of Sorting on a Mesh-Connected Computer

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

HeteroSort load balances and sorts within static or dynamic networks using a conceptual torus mesh. We ported HeteroSort to a 16-node Beowulf cluster with a central switch architecture. By capturing global system knowledge in overlapping microregions of nodes, HeteroSort is useful in data dependent applications such as data information fusion on distributed processors.