Advertisement

Prospects of Collaboration between Compute Providers by Means of Job Interchange

  • Christian Grimme
  • Joachim Lepping
  • Alexander Papaspyrou
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4942)

Abstract

This paper empirically explores the advantages of the collaboration between different parallel compute sites in a decentralized grid scenario. To this end, we assume independent users that submit their jobs to their local site installation. The sites are allowed to decline the local execution of jobs by offering them to a central job pool. In our analysis we evaluate the performance of three job sharing algorithms that are based on the commonly used algorithms First-Come-First-Serve, EASY Backfilling, and List-Scheduling. The simulation results are obtained using real workload traces and compared to single site results. We show that simple job pooling is beneficial for all sites even if the local scheduling systems remain unchanged. Further, we show that it is possible to achieve shorter response times for jobs compared to the best single-site scheduling results.

Keywords

Large Site Small Site First Come First Serve Local Scheduler Local Queue 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aida, K.: Effect of Job Size Characteristics on Job Scheduling Performance. In: Feitelson, D.G., Rudolph, L. (eds.) IPDPS-WS 2000 and JSSPP 2000. LNCS, vol. 1911, pp. 1–17. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  2. 2.
    England, D., Weissman, J.B.: Cost and Benefits of Load Sharing in the Computational Grid. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2004. LNCS, vol. 3277, pp. 160–175. Springer, Heidelberg (2005)Google Scholar
  3. 3.
    Ernemann, C., Hamscher, V., Schwiegelshohn, U., Streit, A., Yahyapour, R.: Enhanced algorithms for multi-site scheduling. In: Parashar, M. (ed.) GRID 2002. LNCS, vol. 2536, pp. 219–231. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  4. 4.
    Ernemann, C., Hamscher, V., Schwiegelshohn, U., Streit, A., Yahyapour, R.: On advantages of grid computing for parallel job scheduling. In: Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID 2002), pp. 39–46. IEEE Computer Society Press, Los Alamitos (2002)CrossRefGoogle Scholar
  5. 5.
    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 2004), pp. 374–379. IEEE Computer Society Press, Los Alamitos (2004)CrossRefGoogle Scholar
  6. 6.
    Feitelson, D.G., Rudolph, L., Schwiegelshohn, U., Sevcik, K.C., Wong, P.: Theory and practice in parallel job scheduling. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1997 and JSSPP 1997. LNCS, vol. 1291, pp. 1–34. Springer, Heidelberg (1997)Google Scholar
  7. 7.
    Feitelson, D.G., Weil, A.M.: Utilization and Predictability in Scheduling the IBM SP2 with Backfilling. In: Proceedings of the 12th International Parallel Processing Symposium and the 9th Symposium on Parallel and Distributed Processing, pp. 542–547. IEEE Computer Society Press, Los Alamitos (1998)Google Scholar
  8. 8.
    Foster, I.: What is the Grid? - A Three Point Checklist. GRIDtoday, 1(6) (July 2002)Google Scholar
  9. 9.
    Foster, I., Kesselman, C.: The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco (1999)Google Scholar
  10. 10.
    Franke, C., Lepping, J., Schwiegelshohn, U.: Greedy Scheduling with Complex Objectives. In: Proceedings of the 2007 IEEE Symposium Series in Computational Intelligence, IEEE Computer Society Press, Los Alamitos (to appear, 2007)Google Scholar
  11. 11.
    Franke, C., Lepping, J., Schwiegelshohn, U.: On Advantages of Scheduling Using Genetic Fuzzy Systems. In: Frachtenberg, E., Schwiegelshohn, U. (eds.) JSSPP 2006. LNCS, vol. 4376, pp. 68–93. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  12. 12.
    Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM Journal of Applied Mathematics 17(2), 416–429 (1969)zbMATHCrossRefGoogle Scholar
  13. 13.
    Grimme, C., Langhammer, T., Papaspyrou, A., Schintke, F.: Negotiation-based choreography of data-intensive applications in the c3grid project. In: Proceedings of the German e-Science Conference (GES) (to appear, 2007)Google Scholar
  14. 14.
    Hamscher, V., Schwiegelshohn, U., Streit, A., Yahyapour, R.: Evaluation of job-scheduling strategies for grid computing. In: Buyya, R., Baker, M. (eds.) GRID 2000. LNCS, vol. 1971, pp. 191–202. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  15. 15.
    Keahey, K., Fredian, T.W., Peng, Q., Schissel, D.P., Thompson, M.R., Foster, I., Greenwald, M.J., McCune, D.: Computational Grids in Action: The National Fusion Collaboratory. Future Generation Computer Systems 18(8), 1005–1015 (2002)zbMATHCrossRefGoogle Scholar
  16. 16.
    Lifka, D.A.: The ANL/IBM SP scheduling system. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1995 and JSSPP 1995. LNCS, vol. 949, pp. 295–303. Springer, Heidelberg (1995)Google Scholar
  17. 17.
    Lu, K., Subrata, R., Zomaya, A.Y.: Towards decentralized load balancing in a computational grid environment. In: Chung, Y.-C., Moreira, J.E. (eds.) GPC 2006. LNCS, vol. 3947, pp. 466–477. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  18. 18.
    Motwani, R., Phillips, S., Torng, E.: Nonclairvoyant scheduling. Theoretical Computer Science 130(1), 17–47 (1994)zbMATHCrossRefMathSciNetGoogle Scholar
  19. 19.
    Schwiegelshohn, U.: Preemptive weighted completion time scheduling of parallel jobs. SIAM Journal of Computing 33, 1280–1308 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  20. 20.
    Schwiegelshohn, U., Yahyapour, R.: Fairness in parallel job scheduling. Journal of Scheduling 3(5), 297–320 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  21. 21.
    Smarr, L., Catlett, C.E.: Metacomputing. Commun. ACM 35(6), 44–52 (1992)CrossRefGoogle Scholar
  22. 22.
    Tonellotto, N., Wieder, P., Yahyapour, R.: A proposal for a generic grid scheduling architecture. In: Gorlach, S., Danelutto, M. (eds.) Proceedings of the Integrated Research in Grid Computing Workshop, November 2005, pp. 337–346 (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Christian Grimme
    • 1
  • Joachim Lepping
    • 1
  • Alexander Papaspyrou
    • 1
  1. 1.Robotics Research InstituteUniversity DortmundDortmundGermany

Personalised recommendations