Skip to main content

Data Redistribution Algorithms for Homogeneous and Heterogeneous Processor Rings

  • Conference paper

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

Abstract

We consider the problem of redistributing data on homogeneous and heterogeneous processor rings. The problem arises in several applications, each time after a load-balancing mechanism is invoked (but we do not discuss the load-balancing mechanism itself). We provide algorithms that aim at optimizing the data redistribution, both for uni-directional and bi-directional rings. One major contribution of the paper is that we are able to prove the optimality of the proposed algorithms in all cases except that of a bi-directional heterogeneous ring, for which the problem remains open.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brent, R.P.: The LINPACK Benchmark on the AP1000: Preliminary Report. In: CAP Workshop 1991, Australian National University (1991), Website: http://www.netlib.org/linpack/

  2. Calvert, K.L., Doar, M.B., Zegura, E.W.: Modeling internet topology. IEEE Communications Magazine 35(6), 160–163 (1997), Available at: http://citeseer.nj.nec.com/calvert97modeling.html

    Article  Google Scholar 

  3. Doar, M.: A better model for generating test networks. In: Proceedings of Globecom 1996 (November 1996), Available at: http://citeseer.nj.nec.com/doar96better.html

  4. Downey, A.B.: Using pathchar to estimate internet link characteristics. In: Measurement and Modeling of Computer Systems, pp. 222–223 (1999), Available at: http://citeseer.nj.nec.com/downey99using.html

  5. Legrand, A., Marchal, L., Casanova, H.: Scheduling Distributed Applications: The SimGrid Simulation Framework. In: Proceedings of the Third IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2003) (May 2003)

    Google Scholar 

  6. Renard, H., Robert, Y., Vivien, F.: Data redistribution algorithms for heterogeneous processor rings. Research Report RR-2004-28, LIP, ENS Lyon, France (May 2004), Also available as INRIA Research Report RR-5207

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Renard, H., Robert, Y., Vivien, F. (2004). Data Redistribution Algorithms for Homogeneous and Heterogeneous Processor Rings. In: Bougé, L., Prasanna, V.K. (eds) High Performance Computing - HiPC 2004. HiPC 2004. Lecture Notes in Computer Science, vol 3296. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30474-6_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30474-6_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24129-4

  • Online ISBN: 978-3-540-30474-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics