Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Book cover Parallel and Distributed Processing (IPDPS 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1800))

Included in the following conference series:

  • 1046 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Reference

  1. Gu, Qian Ping, and Jun Gu: Algorithms and Average Time Bounds of Sorting on a Mesh-Connected Computer. IEEE Transactions on Parallel and Distributed Systems. Vol 5, no 3. (March 1994)308–315

    Article  Google Scholar 

  2. Lin, Yen-Chun: On Balancing Sorting on a Linear Array. IEEE Transactions on Parallel and Distributed Systems. Vol 4, no 5. (May 1993) 566–571

    Article  Google Scholar 

  3. Thompson, C.D., and H.T. Kung: Sorting on a Mesh-connected Parallel Computer. Communication of the ACM. Vol 20, no 40,. (April 1977) 263–271

    Article  MathSciNet  Google Scholar 

  4. Xu, Chengzhong and Francis Lau: Load Balancing in Parallel Computers: Theory and Practice. Kluwer Academic Publishers, Boston (1997)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate Programs in Software, University of St. Thomas, Mail # OSS 301, 2115 Summit Avenue, Saint Paul, MN, 55105, USA

    Pamela Yang, Timothy M. Kunau, Bonnie Holte Bennett & Emmett Davis

  2. Honeywell Technology Center, 3660 Technology Drive, Minneapolis, MN, 55418, USA

    Bill Wren

Authors
  1. Pamela Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Timothy M. Kunau
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bonnie Holte Bennett
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Emmett Davis
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Bill Wren
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Centre Universitaire d’Informatique, Université de Genève, 24, rue Général Dufour, CH-1211, Genève 4, Switzerland

    José Rolim

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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: Rolim, J. (eds) Parallel and Distributed Processing. IPDPS 2000. Lecture Notes in Computer Science, vol 1800. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45591-4_118

Download citation

  • DOI: https://doi.org/10.1007/3-540-45591-4_118

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67442-9

  • Online ISBN: 978-3-540-45591-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation