Skip to main content

Towards Feasible and Effective Load Sharing in a Heterogeneous Computational Grid

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4459))

Abstract

A grid has to provide strong incentive for participating sites to join and stay in it. Participating sites are concerned with the performance improvement brought by the gird for the jobs of their own local user communities. Feasible and effective load sharing is key to fulfilling such a concern. This paper explores the load-sharing policies concerning feasibility and heterogeneity on computational grids. Several job scheduling and processor allocation policies are proposed and evaluated through a series of simulations using workloads derived from publicly available trace data. The simulation results indicate that the proposed job scheduling and processor allocation policies are feasible and effective in achieving performance improvement on a heterogeneous computational grid.

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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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. Hamscher, V., et al.: Evaluation of Job-Scheduling Strategies for Grid Computing. In: Proceedings of the 7th International Conference on High Performance Computing, HiPC-2000, Bangalore, India, pp. 191–202 (2000)

    Google Scholar 

  2. Hamscher, V., et al.: Enhanced Algorithms for Multi-site Scheduling. In: Parashar, M. (ed.) GRID 2002. LNCS, vol. 2536, pp. 219–231. Springer, Heidelberg (2002)

    Google Scholar 

  3. Ernemann, C., et al.: On Advantages of Grid Computing for Parallel Job Scheduling. In: Proceedings of 2nd IEEE International Symposium on Cluster Computing and the Grid (CC-GRID 2002), Berlin, Germany, pp. 39–46 (2002)

    Google Scholar 

  4. Ernemann, C., et al.: On Effects of Machine Configurations on Parallel Job Scheduling in Computational Grids. In: Schmeck, H., Ungerer, T., Wolf, L. (eds.) ARCS 2002. LNCS, vol. 2299, pp. 169–179. Springer, Heidelberg (2002)

    Google Scholar 

  5. Buyya, R., et al.: Economic Models for Resource Management and Scheduling in Grid Computing. The Journal of Concurrency and Computation: Practice and Experience (CCPE) (Special Issue on Grid Computing Environments) (May 2002)

    Google Scholar 

  6. Buyya, R., Giddy, J., Abramson, D.: An Evaluation of Economy-Based Resource Trading and Scheduling on Computational Power Grids for Parameter Sweep Applications. In: Proceedings of the Second Workshop on Active Middleware Services (AMS2000), In conjunction with the Ninth IEEE International Symposium on High Performance Distributed Computing (HPDC 2000), Pittsburgh, USA (August 2000)

    Google Scholar 

  7. Zhu, Y., et al.: TruGrid: A Self-sustaining Trustworthy Grid. In: Proceedings of the First International Workshop on Mobility in Peer-to-Peer Systems (MPPS) (ICDCSW’05), June 2005, pp. 815–821 (2005)

    Google Scholar 

  8. Ernemann, C., Hamscher, V., Yahyapour, R.: Economic Scheduling in Grid Computing. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2002. LNCS, vol. 2537, pp. 128–152. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  9. England, D., Weissman, J.B.: Costs and Benefits of Load Sharing in Computational Grid. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2004. LNCS, vol. 3277, Springer, Heidelberg (2005)

    Google Scholar 

  10. Huang, K.C., Chang, H.Y.: An Integrated Processor Allocation and Job Scheduling Approach to Workload Management on Computing Grid. In: Proceedings of the 2006 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA’06), Las Vegas, USA, June 26-29, 2006, pp. 703–709 (2006)

    Google Scholar 

  11. Sadayappan, P., et al.: Scheduling of Parallel Jobs in a Heterogeneous Multi-site Environment. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2003. LNCS, vol. 2862, pp. 87–104. Springer, Heidelberg (2003)

    Google Scholar 

  12. Brune, M., et al.: Managing Clusters of Geographically Distributed High-Performance Computers. Concurrency - Practice and Experience 11(15), 887–911 (1999)

    Article  Google Scholar 

  13. Bucur, A.I.D., Epema, D.H.J.: The Performance of Processor Co-Allocation in Multicluster Systems. In: Proceedings of the Third IEEE International Symposium on Cluster Computing and the Grid (CCGrid’03), May 2003, p. 302 (2003)

    Google Scholar 

  14. Bucur, A.I.D., Epema, D.H.J.: The Influence of Communication on the Performance of Co-Allocation. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 2001. LNCS, vol. 2221, pp. 66–86. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  15. Bucur, A.I.D., Epema, D.H.J.: Local versus Global Schedulers with Processor Co-allocation in Multicluster Systems. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2002. LNCS, vol. 2537, pp. 184–204. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  16. Banen, S., Bucur, A.I.D., Epema, D.H.J.: A Measurement-Based Simulation Study of Processor Co-Allocation in Multicluster Systems. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2003. LNCS, vol. 2862, pp. 105–128. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  17. Zhang, W., Cheng, A.M.K., Hu, M.: Multisite Co-allocation Algorithms for Computational Grid. In: Proceedings of the 20th International Parallel and Distributed Processing Symposium, April 2006, p. 8 (2006)

    Google Scholar 

  18. Feitelson, D., Rudolph, L.: Parallel Job Scheduling: Issues and Approaches. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1995 and JSSPP 1995. LNCS, vol. 949, pp. 1–18. Springer, Heidelberg (1995)

    Google Scholar 

  19. Ernemann, C., Hamscher, V., Yahyapour, R.: Benefits of Global Grid Computing for Job Scheduling. In: Proceedings of the Fifth IEEE/ACM International Workshop on Grid Computing(GRID’04), November 2004, pp. 374–379 (2004)

    Google Scholar 

  20. Parallel Workloads Archive, http://www.cs.huji.ac.il/labs/parallel/workload/

  21. Foster, I., Kesselman, C.: The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Christophe Cérin Kuan-Ching Li

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Huang, KC., Shih, PC., Chung, YC. (2007). Towards Feasible and Effective Load Sharing in a Heterogeneous Computational Grid. In: Cérin, C., Li, KC. (eds) Advances in Grid and Pervasive Computing. GPC 2007. Lecture Notes in Computer Science, vol 4459. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72360-8_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72360-8_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72359-2

  • Online ISBN: 978-3-540-72360-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics