Skip to main content

Overlay Network Management for Scheduling Tasks on the Grid

  • Conference paper
Book cover Distributed Computing and Internet Technology (ICDCIT 2007)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4882))

  • 483 Accesses

Abstract

In this paper, we address the problem of building and maintaining dynamic overlay networks on top of physical networks for the autonomous scheduling of divisible load Grid applications. While autonomous scheduling protocols exist to maximize steady-state throughputs for given overlay networks, not much work has been done on building the most efficient overlay. In our work, nodes use the bandwidth-centric principle to select other nodes with which overlay edges must be formed dynamically. The node which has the entire dataset initially (the scheduler) starts forming the overlay and the nodes which receive tasks at rates greater than their task execution rates further expand it. We use simulation studies to illustrate the functioning of our overlay forming mechanism, and its robustness to changes in the characteristics of the system resources.

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. Kosar, T., Livny, M.: Stork: Making data placement a first class citizen in the grid. In: Proc. of ICDCS 2004, IEEE Computer Society, pp. 342–349. IEEE Computer Society Press, Los Alamitos (2004)

    Google Scholar 

  2. Bharadwaj, V., Robertazzi, T.G., Ghose, D.: Scheduling Divisible Loads in Parallel and Distributed Systems. IEEE Computer Society Press, Los Alamitos (1996)

    Google Scholar 

  3. Ullman, J.: NP-complete scheduling problems. Journal of Computer and Syst. Sciences 10, 384–393 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  4. Kreaseck, B., Carter, L., Casanova, H., Ferrante, J.: Autonomous protocols for bandwidth-centric scheduling of independent-task applications. In: Proc. of IPDPS 2003, pp. 23–25. IEEE Computer Society, Los Alamitos (2003)

    Google Scholar 

  5. Chakravarti, A.J., Baumgartner, G., Lauria, M.: The organic grid: Self-organizing computational biology on desktop grids. Parallel Computing for Bioinformatics  (2005)

    Google Scholar 

  6. Nandy, S., Carter, L., Ferrante, J.: A-fast: Autonomous flow approach to scheduling tasks. In: Bougé, L., Prasanna, V.K. (eds.) HiPC 2004. LNCS, vol. 3296, pp. 363–374. Springer, Heidelberg (2004)

    Google Scholar 

  7. Beaumont, O., Carter, L., Ferrante, J., Legrand, A., Robert, Y.: Bandwidth-centric allocation of independent task on heterogeneous platforms. In: Proc. of IPDPS 2002, IEEE Computer Society, Los Alamitos (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Tomasz Janowski Hrushikesha Mohanty

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ponnavaikko, K., Janakiram, D. (2007). Overlay Network Management for Scheduling Tasks on the Grid. In: Janowski, T., Mohanty, H. (eds) Distributed Computing and Internet Technology. ICDCIT 2007. Lecture Notes in Computer Science, vol 4882. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77115-9_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77115-9_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77112-8

  • Online ISBN: 978-3-540-77115-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics