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. © 2000 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Yang, P., Kunau, T. M., Bennett, B. H., Davis, E., & Wren, B. (2000). Reconfigurable parallel sorting and load balancing on a Beowulf cluster: HeteroSort. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1800 LNCS, pp. 862–869). Springer Verlag. https://doi.org/10.1007/3-540-45591-4_118
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
