Skip to main content

Distributed Location of Shared Resources and Its Application to the Load Sharing Problem in Heterogeneous Distributed Systems

  • Conference paper
High Performance Computing (ISHPC 2003)

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

Included in the following conference series:

  • 561 Accesses

Abstract.

In this paper, we propose a distributed algorithm for solving a resource location problem in distributed systems. The proposed algorithm is fully distributed in the sense that it assumes no centralized control, and has a remarkable property such that it can always find a target node satisfying a certain property, if any. The result of simulations implies that: (1) the performance of the underlying load sharing scheme can be significantly improved by increasing the preciseness of a node location, and (2) in the proposed scheme, the average number of inquiries per location is bounded by a very small value (e.g., only two inquiries are enough even when the underlying system consists of 100 nodes).

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

Access this chapter

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.

References

  1. Blumofe, R.D., Leiserson, C.E.: Scheduling multithread computations by work stealing. JACM 46(5), 720–748 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  2. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)

    MATH  Google Scholar 

  3. Catlett, C., Smarr, L.: Metacomputing. CACM 35, 44–52 (1992)

    Google Scholar 

  4. Eager, D.L., Lazowska, E.D., Zahorjan, J.: Adaptive load sharing in homogeneous distributed systems. IEEE Trans. Software Eng., 662–675 (May 1986)

    Google Scholar 

  5. Fujita, S., Yamashita, M.: Maintaining a dynamic set of processors in a distributed system. In: Babaoğlu, Ö., Marzullo, K. (eds.) WDAG 1996. LNCS, vol. 1151, pp. 220–233. Springer, Heidelberg (1996)

    Google Scholar 

  6. Harchol-Balter, M., Downey, A.B.: Exploiting lifetime distributions for dynamic load balancing. In: Prof. ACM SIGMETRICS 1996 Conference on Measurement & Modeling of Comput. Syst., pp. 13–24. ACM, New York (1996)

    Chapter  Google Scholar 

  7. Kleinrock, L.: Queuing Systems, vol. 1. Wiley, New York (1976)

    Google Scholar 

  8. Leland, W.E., Ott, T.J.: Load-balancing heuristics and process behavior. In: Prof. ACM SIGMETRICS 1986 Conference on Measurement & Modeling of Comput. Syst., pp. 54–69. ACM, New York (1986)

    Google Scholar 

  9. Shivaratri, N.G., Krueger, P., Singhal, M.: Load distributing for locally distributed systems. IEEE Computer 25(12), 33–44 (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fujita, S., Tagashira, S. (2003). Distributed Location of Shared Resources and Its Application to the Load Sharing Problem in Heterogeneous Distributed Systems. In: Veidenbaum, A., Joe, K., Amano, H., Aiso, H. (eds) High Performance Computing. ISHPC 2003. Lecture Notes in Computer Science, vol 2858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39707-6_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39707-6_34

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics