Skip to main content

Communication Aware Co-scheduling for Parallel Job Scheduling in Cluster Computing

  • Conference paper
Advances in Computing and Communications (ACC 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 191))

Included in the following conference series:

Abstract

Parallel job scheduling is gaining an important topic in the field of research. The main issue is how to allocate jobs to the multiprocessor systems and to improve the system performance. Co-scheduling is the concurrent scheduling of parallel jobs on individual nodes of multiprocessor systems. There are three main co-scheduling policies namely explicit co-scheduling, local scheduling and implicit co-scheduling. But no consideration is given for parallel jobs which are communication intensive. A new algorithm is devised for this issue named communication aware co-scheduling. The workload from Grid5000 is considered for performance evaluation.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ousterhout, J.K.: Scheduling Techniques for concurrent systems, Identification of Common Molecular Subsequences. In: Smith, T.F., Waterman, M.S. (eds.) International Conference on Distributed Computing Systems (1982)

    Google Scholar 

  2. Franke, H., Pattnaik, P., Rudolph, L.: Gang scheduling for highly efficient distributed multiprocessor systems. In: Sixth Symposium on the Frontiers of Massively Parallel Computation (1996)

    Google Scholar 

  3. Jette, M.A.: Performance characteristics of Gang scheduling in multiprogrammed environments. In: ACM/IEEE Conference on Super Computing (1997)

    Google Scholar 

  4. Silva, F.A.B., Scherson, I.D.: Improving throughput and Utilization in Parallel machines through concurrent gang. In: 14th International Parallel and Distributed Processing Symposium (2000)

    Google Scholar 

  5. Petrini, F., Feng, W.C.: Buffered Coscheduling: A new methodology for multitasking parallel jobs on distributed systems. In: International Parallel and distributed Processing Symposium (2000)

    Google Scholar 

  6. Batat, A., Feitelson, D.G.: Gang scheduling with memory considerations. In: 14th International Parallel and Distributed Processing Symposium (2000)

    Google Scholar 

  7. Zhang, Y., Franke, H., Moreira, J.E., Sivasubramaniam, A.: Improving parallel job scheduling by combining gang scheduling and backfilling techniques. In: 14th International Parallel and Distributed Processing Symposium (2000)

    Google Scholar 

  8. Zhou, B.B., Brent, R.P.: Gang scheduling with a queue for large jobs. In: 15th International Parallel and Distributed Processing Symposium (2001)

    Google Scholar 

  9. Karatza, H.D.: Gang scheduling performance on a cluster of non-dedicated workstations. In: 35th IEEE Annual Simulation Symposium (2002)

    Google Scholar 

  10. Agarwal, S., Choi, G.S., Das, C.R.: Co-ordinated coscheduling in time-sharing clusters through a generic framework. In: IEEE International Conference on Cluster Computing (2003)

    Google Scholar 

  11. Ryu, K.D., Pachapurkar, M., Fong, L.L.: Adaptive memory paging for efficient gang scheduling of parallel applications. In: 18th IEEE International Parallel and Distributed Processing Symposium (2004)

    Google Scholar 

  12. Strazdins, P., Uhlmann, J.: A comparison of local and gang scheduling on a Beowulf cluster. In: IEEE International Conference on Cluster Computing (2004)

    Google Scholar 

  13. Frachtenberg, E., Feitelson, D.G., Petrini, F., Fernandez, J.: Adaptive parallel job scheduling with flexible coscheduling. In: IEEE Transactions on Parallel and Distributed Systems (2005)

    Google Scholar 

  14. Frachtenberg, E., Feitelson, D.G.: Pitfalls in parallel job scheduling evaluation. In: Feitelson, D.G., Frachtenberg, E., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2005. LNCS, vol. 3834, pp. 257–282. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  15. Grid’5000 team, Dr.Franck Cappello (June 2010), http://gwa.ewi.tudelf.nl/pmwiki/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Madheswari, A.N., Banu, R.S.D.W. (2011). Communication Aware Co-scheduling for Parallel Job Scheduling in Cluster Computing. In: Abraham, A., Lloret Mauri, J., Buford, J.F., Suzuki, J., Thampi, S.M. (eds) Advances in Computing and Communications. ACC 2011. Communications in Computer and Information Science, vol 191. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22714-1_56

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22714-1_56

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22713-4

  • Online ISBN: 978-3-642-22714-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics