Skip to main content
SpringerLink
Log in

Decentralized Preemptive Scheduling Across Heterogeneous Multi-core Grid Resources

  • Conference paper
  • First Online:
Job Scheduling Strategies for Parallel Processing (JSSPP 2013)

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

Included in the following conference series:

Abstract

The recent advent of multi-core computing environments increases the heterogeneity of grid resources and the complexity of managing them, making efficient load balancing challenging. In an environment where jobs are submitted regularly into a grid which is already executing several jobs, it becomes important to provide low job turn-around times and high throughput for the users. Typically, the grids employ a First Come First Serve (FCFS) method of executing the jobs in the queue which results in suboptimal turn-around times and wait times for most jobs. Hence a conventional FCFS scheduling strategy does not suffice to reduce the average wait times across all jobs. In this paper, we propose new decentralized preemptive scheduling strategies that backfill jobs locally and dynamically migrate waiting jobs across nodes to leverage residual resources, while guaranteeing (on a best effort basis) bounded turn-around and waiting times for all jobs. The methods attempt to maximize total throughput and minimize average waiting time while balancing load across available grid resources. Experimental results for both intra-node and internode scheduling via simulation show that our scheduling schemes perform considerably better than the conventional FCFS approach of a distributed or a centralized scheduler.

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

Access this chapter

Log in via an institution
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 EPUB and 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

References

  1. Al-Azzoni, I., Down, D.G.: Dynamic scheduling for heterogeneous desktop grids. J. Parallel Distrib. Comput. 70(12), 1231–1240 (2010)

    Article  MATH  Google Scholar 

  2. Bach, M.J.: The Design of the UNIX Operating System, Chapter 8 - Process Scheduling and Time. Prentice Hall, Upper Saddle River (1986)

    Google Scholar 

  3. Berman, F., Wolski, R., Figueira, S., Schopf, J., Shao, G.: Application level scheduling on distributed heterogenous networks. In: Proceedings of the 1996 ACM/IEEE Conference on Supercomputing. ACM/IEEE (1996)

    Google Scholar 

  4. Zhou, D., Lo, V.: Wave scheduler: scheduling for faster turnaround time in peer-based desktop grid systems. In: Feitelson, D.G., Frachtenberg, E., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2005. LNCS, vol. 3834, pp. 194–218. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Zhou, D., Lo, V.: Wavegrid: a scalable fast-turnaround heterogeneous peer-based desktop grid system. In: Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS2006), April 2006. IEEE Computer Society Press (2006)

    Google Scholar 

  6. Harchol-Balter, M., Schroeder, B., Bansal, N., Agrawal, M.: Size-based scheduling to improve web performance. ACM Trans. Comput. Syst. 21(2), 207–233 (2003)

    Article  Google Scholar 

  7. Jiménez, V.J., Vilanova, L., Gelado, I., Gil, M., Fursin, G.G., Navarro, N.: Predictive runtime code scheduling for heterogeneous architectures. In: Seznec, A., Emer, J., O’Boyle, M., Martonosi, M., Ungerer, T. (eds.) HiPEAC 2009. LNCS, vol. 5409, pp. 19–33. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  8. Kim, J.S., Keleher, P., Marsh, M., Bhattacharjee, B., Sussman, A.: Using content-addressable networks for load balancing in desktop grids. In: Proceedings of the 16th IEEE International Symposium on High Performance, Distributed Computing (HPDC-16), June 2007 (2007)

    Google Scholar 

  9. Lee, J., Keleher, P., Sussman, A.: Decentralized dynamic scheduling across heterogeneous multi-core desktop grids. In: Proceedings of the 19th International Heterogeneity in Computing Workshop (HCW2010), April 2010. IEEE Computer Society Press (2010)

    Google Scholar 

  10. Lee, J., Keleher, P., Sussman, A.: Supporting computing element heterogeneity in p2p grids. In: Proceedings of the IEEE Cluster 2011 Conference, September 2011. IEEE Computer Society Press (2011)

    Google Scholar 

  11. Li, C., Ding, C., Shen, K.: Quantifying the cost of context switch. In: Proceedings of the 2007 Workshop on Experimental Computer Science ExpCS ’07. ACM, New York (2007)

    Google Scholar 

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

    Google Scholar 

  13. Niu, S., Zhai, J., Ma, X., Liu, M., Zhai, Y., Chen, W., Zheng, W.: Employing checkpoint to improve job scheduling in large-scale systems. In: Cirne, W., Desai, N., Frachtenberg, E., Schwiegelshohn, U. (eds.) JSSPP 2012. LNCS, vol. 7698, pp. 36–55. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  14. Raman, R., Livny, M., Solomon, M.: Matchmaking: distributed resource management for high throughput computing. In: Proceedings of the 7th International Symposium on High Performance, Distributed Computing, July 1998, pp. 140–146 (1998)

    Google Scholar 

  15. Moore, S.: Multicore is bad news for super computers. IEEE Spectrum. 45(11), 15 (2008)

    Article  Google Scholar 

  16. Snell, Q.O., Clement, M.J., Jackson, D.B.: Preemption based backfill. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2002. LNCS, vol. 2537, pp. 24–37. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  17. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. In: Proceedings of the ACM SIGCOMM Conference, August 2001 (2001)

    Google Scholar 

  18. Stallings, W.: Operating Systems: Internals and Design Principles, 4th edn. Prentice Hall, Upper Saddle River (2001). ISBN: 0-13-031999-6

    Google Scholar 

  19. Tanenbaum, A.S.: Modern Operating Systems, 3rd edn. Pearson Education, Upper Saddle River (2008). ISBN: 0-13-600663-9

    Google Scholar 

  20. Thompson, K.: UNIX implementation. Bell Syst. Tech. J. 57, 1931–1946 (1978)

    Article  Google Scholar 

  21. Leinberger, W., Karypis, G., Kumar, V.: Job scheduling in the presence of multiple resource requirements. In: Supercomputing ’99: Proceedings of the 1999 ACM/IEEE Conference on Supercomputing (CDROM), p. 47. ACM, NewYork (1999)

    Google Scholar 

  22. Leinberger, W., Karypis, G., Kumar, V., Biswas, R.: Load balancing across near-homogeneous multi-resource servers. In: Proceedings of the 9th Heterogeneous Computing Workshop, appears with the Proceedings of IPDPS 2000, pp. 60–71 (2000)

    Google Scholar 

  23. Xhafa, F., Abraham, A.: Computational models and heuristic methods for grid scheduling problems. Future Gener. Comput. Syst. 26(4), 608–621 (2010)

    Article  Google Scholar 

Download references

Acknowledgements

We appreciate the comments received from anonymous reviewers of the JSSPP 2013 workshop. They pointed out some key issues that has led us to do further research on this topic. We thank Manjunath Gopinath, Bin Liu, Sarat Babu Eruvuru, Bhavani Bhaskar and Abhishek Prasad for their participation in discussions and their feedback on this idea.

Author information

Authors and Affiliations

  1. Institute for Software Research, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA, 15213, USA

    Arun Balasubramanian & Norman Sadeh

  2. Department of Computer Science, University of Maryland, College Park, MD, 20742, USA

    Alan Sussman

Authors
  1. Arun Balasubramanian
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alan Sussman
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Norman Sadeh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Arun Balasubramanian .

Editor information

Editors and Affiliations

  1. Mathematics & Computer Science Division, Argonne National Laboratory, Argonne, Illinois, USA

    Narayan Desai

  2. Google, Mountain View, California, USA

    Walfredo Cirne

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Balasubramanian, A., Sussman, A., Sadeh, N. (2014). Decentralized Preemptive Scheduling Across Heterogeneous Multi-core Grid Resources. In: Desai, N., Cirne, W. (eds) Job Scheduling Strategies for Parallel Processing. JSSPP 2013. Lecture Notes in Computer Science(), vol 8429. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43779-7_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-43779-7_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-43778-0

  • Online ISBN: 978-3-662-43779-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation