Skip to main content
SpringerLink
Log in

Reconfigurable parallel sorting and load balancing: HeteroSort

  • Conference paper
  • First Online:
Parallel and Distributed Processing (IPPS 1999)

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

Included in the following conference series:

  • 126 Accesses

Abstract

HeteroSort load balances and sorts within static or dynamic networks. Upon failure of a node or path, HeteroSort uses a genetic algorithm to minimize the distribution path by optimally mapping the network to physical near neighbor nodes. We include a proof that a final state of HeteroSort (barren best trades of the Wren cycle) is always a detection of termination of sorting. 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Examples of these fault tolerant efforts can be found in the work of Jay Strosnider and his colleagues at Department of Electrical and Computing Engineering, Carnegie Mellon University in the Fault-Tolerant Real Time Computing Project. Katcher, Daniel I., Jay K. Strosnider, and Elizabeth A. Hinzelman-Fortino. “Dynamic versus Fixed Priority Scheduling: A Case Study” http://usa.ece.cmu.edu/Jteam/papers/abstracts/tse93.abs.html. Ramos-Theul, Sandra and Jay K. Strosnider. “Scheduling Fault Tolerant Operations for Time-Critical Applications.” http://usa.ece.cmu.edu/Jteam/papers/abstracts/dcca94.abs.html. Theul, Sandra. “Enhancing the Fault Tolerance of Real-Time Systems Through Time Redundancy.” http://usa.ece.cmu.edu/Jteam/papers/abstracts/thuel.abs.html.

    Google Scholar 

  2. Xu, Chengzhong and Francis C.M. Lau. Load Balancing in Parallel Computers: Theory and Practice. (Boston: Kluwer Academic Publishers, 1997), p. 122.

    Google Scholar 

  3. Lin, Yen-Chun. “On Balancing Sorting on a Linear Array.” IEEE Transactions on Parallel and Distributed Systems, vol 4, no 5, pp. 566–571, May 1993. Thompson, C.D., and H.T. Kung. “Sorting on a Mesh-connected Parallel Computer.” Communication of the ACM, vol 20, no 40, pp. 263–271, April 1977.

    Article  Google Scholar 

  4. Scherson, Isaac D., and Sandeep Sen. “Parallel Sorting in Two-Dimensional VSLI Models of Computation.” IEEE Transactions of Computers, vol 38, no 2, pp. 238–249, February 1989. 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, pp. 308–315, March 1994.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Emmett Davis, Dr. Bonnie Holte Bennett & Dr. Linda Davis

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

    Bill Wren

Authors
  1. Emmett Davis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dr. Bonnie Holte Bennett
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bill Wren
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Dr. Linda Davis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

José Rolim Frank Mueller Albert Y. Zomaya Fikret Ercal Stephan Olariu Binoy Ravindran Jan Gustafsson Hiroaki Takada Ron Olsson Laxmikant V. Kale Pete Beckman Matthew Haines Hossam ElGindy Denis Caromel Serge Chaumette Geoffrey Fox Yi Pan Keqin Li Tao Yang G. Chiola G. Conte L. V. Mancini Domenique Méry Beverly Sanders Devesh Bhatt Viktor Prasanna

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag

About this paper

Cite this paper

Davis, E., Bennett, B.H., Wren, B., Davis, L. (1999). Reconfigurable parallel sorting and load balancing: HeteroSort. In: Rolim, J., et al. Parallel and Distributed Processing. IPPS 1999. Lecture Notes in Computer Science, vol 1586. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0098017

Download citation

  • DOI: https://doi.org/10.1007/BFb0098017

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65831-3

  • Online ISBN: 978-3-540-48932-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation