Skip to main content

Design of the Force Field Task Assignment Method and Associated Performance Evaluation for Desktop Grids

  • Conference paper
Grid and Cooperative Computing - GCC 2005 (GCC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 3795))

Included in the following conference series:

  • 461 Accesses

Abstract

In the case of desktop grids, a single hardware-determined latency and constant bandwidth between processors cannot be assumed without incurring in unnecessary error. The actual network topology is determined not only by the physical hardware, but also by the instantaneous bandwidth availability for parallel processes to communicate. In this paper we present a novel task assignment scheme which takes the dynamic network topology into consideration along with the traditionally evaluated variables such as processor availability and potential. The method performs increasingly better as the grid size increases.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Foster, I., Kesselman, C. (eds.): The GRID: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco (1999)

    Google Scholar 

  2. Zhuge, H.: The future interconnetion environment. IEEE Computer 4, 27–33 (2005)

    Google Scholar 

  3. Valiant, L.G.: A bridging model for parallel computation. Communications of the ACM 8, 103–111 (1990)

    Article  Google Scholar 

  4. Culler, D., Karp, R., Patterson, D., Sahay, A., Schauser, J., Santos, E., Subramonian, R., von Eicken, T.: Logp: Towards a realistic model of parallel computation. In: Fourth ACM SIGPLAN Symposium on Principles and PRactice of PArallel Programming, pp. 1–12 (1993)

    Google Scholar 

  5. Tiskin, A.: A new way to divide and conquer. Parallel Processing Letters 4 (2001)

    Google Scholar 

  6. Foster, I., Kesselman, C.: Globus: A metacomputing infrastructure toolkit. The International Journal of Supercomputing Applications and High Performance Computing 2, 115–128 (1997)

    Article  Google Scholar 

  7. Litzkow, M., Livny, M., Mutka, M.: Condor - a hunter of idle workstations. In: Proceedings 8th International Conference on Distributed Computing Systems (ICDCS 1988), pp. 104–111 (1988)

    Google Scholar 

  8. Butt, A.R., Zhang, R., Hu, Y.C.: A self-organizing flock of condors. In: Proceedings Super Computing, pp. 15–21. ACM, New York (2003)

    Google Scholar 

  9. Castro, M., Druschel, P., Hu, Y.C., Rowstron, A.: Exploiting network proximity in peer-to-peer overlay networks. Technical report, Microsoft Research, Technical Report MSR.TR-2002-82 (2002)

    Google Scholar 

  10. Kondo, D., Taufer, M., Brooks, C.L., Casanova, H., Chien, A.A.: Characterizing and evaluating desktop grids: An empirical study. Technical report, San Diego Supercomputer Center and University of California, San Diego, Work supported by the National Science Foundation under Grant ACI-0305390 (2004)

    Google Scholar 

  11. Gibbons, A.M., Spirakis, P. (eds.): General Purpose Parallel Computing, pp. 337–391. Cambridge University Press, Cambridge (1993)

    Google Scholar 

  12. van Leeuwen, J. (ed.): Scalable Computing, pp. 46–61. Springer, Heidelberg (1995)

    Google Scholar 

  13. Sujithan, K.R.: Towards a scalable parallel object database - the bulk synchronous parallel approach. Technical report, Wadham College Oxford, Technical Report PRG-TR-17-96 (1996)

    Google Scholar 

  14. Adler, M., Byers, J.W., Karp, R.M.: Scheduling parallel communication: The h-relation problem. Technical report, International Computer Science Institutue, Berkeley, Technical Report TR-95-032 (1995)

    Google Scholar 

  15. Goodrich, M.T.: Communication-efficient parallel sorting. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 247–256. ACM, New York (1996)

    Chapter  Google Scholar 

  16. Shi, H., Schaeffer, J.: Parallel sorting by regular sampling. Journal of Parallel and Distributed Computing 4, 361–372 (1992)

    Article  Google Scholar 

  17. Baumker, A., Dittrich, W., Heide, F.M.: Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the bsp model. Theoretical Computer Science (1998)

    Google Scholar 

  18. Hui, C.C., Chanson, S.T.: Hydrodynamic load balancing. IEEE Trans. Parallel and Distributed Systems 10 (1999)

    Google Scholar 

  19. Papadimitriou, C., Yannakakis, M.: Towards an architecture-independent analysis of parallel algorithms. SIAM J. Comput. 19, 322–328 (1990)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

García, E.W., Morales-Luna, G. (2005). Design of the Force Field Task Assignment Method and Associated Performance Evaluation for Desktop Grids. In: Zhuge, H., Fox, G.C. (eds) Grid and Cooperative Computing - GCC 2005. GCC 2005. Lecture Notes in Computer Science, vol 3795. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11590354_123

Download citation

  • DOI: https://doi.org/10.1007/11590354_123

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30510-1

  • Online ISBN: 978-3-540-32277-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics