Advertisement

QoPS: A QoS Based Scheme for Parallel Job Scheduling

  • Mohammad Islam
  • Pavan Balaji
  • P. Sadayappan
  • D. K. Panda
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2862)

Abstract

Although job scheduling has been much studied, the issue of providing deadline guarantees in this context has not been addressed. In this paper, we propose a new scheme, termed as QoPS to provide Quality of Service (QoS) in the response time given to the end user in the form of guarantees in the completion time to submitted independent parallel jobs. To the best of our knowledge, this scheme is the first one to implement admission control and guarantee deadlines for admitted parallel jobs.

Keywords

QoS Job Scheduling Deadlines Parallel Job Scheduling 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
  2. 2.
    Chiang, S.-H., Vernon, M.K.: Production Job Scheduling for Parallel Shared Memory Systems. In: the Proceedings of the IEEE International Parallel and Distributed Processing Symposium (April 2001)Google Scholar
  3. 3.
    Cirne, W., Berman, F.: Adaptive Selection of Partition Size of Supercomputer Requests. In: the Proceedings of 6th workshop on Job Scheduling Strategies for Parallel Processing (April 2000)Google Scholar
  4. 4.
    Feitelson, D., Rudolph, L., Schwiegelshohn, U., Sevcik, K.C., Wong, P.: 1997. In: The Proceedings of IEEE Workshop on Job Scheduling Strategies for Parallel Processing (1997)Google Scholar
  5. 5.
    Feitelson, D.G.: Parallel Workloads Archive,http://www.cs.huji.ac.il/labs/parallel/workload/
  6. 6.
    Holenarsipur, P., Yarmolenko, V., Duato, J., Panda, D.K., Sadayappan, P.: Characterization and Enhancement of Static Mapping Heuristics for Heterogeneous Systems. In: Prasanna, V.K., Vajapeyam, S., Valero, M. (eds.) HiPC 2000. LNCS, vol. 1970, p. 37. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  7. 7.
    Islam, M., Balaji, P., Sadayappan, P., Panda, D.K.: QoPS: A QoS based scheme for Parallel Job Scheduling. Technical report, The Ohio State University, Columbus, OH (April 2003)Google Scholar
  8. 8.
    Jackson, B., Haymore, B., Facelli, J., Snell, Q.O.: Improving Cluster Utilization Through Set Based Allocation Policies. In: IEEE Workshop on Scheduling and Resource Management for Cluster Computing (September 2001)Google Scholar
  9. 9.
    Keleher, P., Zotkin, D., Perkovic, D.: Attacking the Bottlenecks in Backfilling Schedulers. In: Cluster Computing: The Journal of Networks, Software Tools and Applications (March 2000)Google Scholar
  10. 10.
    Mok, A.K.: Fundamental design problems of distributed systems for the hard realtime environment. PhD thesis, Massachussetts Institute of Technology, Cambridge, MA (May 1983)Google Scholar
  11. 11.
    Mok, A.K.: The design of real-time programming systems based on process models. In: The Proceedings of IEEE Real Time Systems Symposium (December 1984)Google Scholar
  12. 12.
    Mok, A.K., Dertouzos, M.L.: Multi-Processor Scheduling in a Hard Real-Time Environment. In: The Proceedings of the Seventh Texas Conference on Computing Systems (November 1978)Google Scholar
  13. 13.
    Mualem, A.W., Feitelson, D.G.: Utilization, Predictability, Workloads and User Estimated Runtime Esti mates in Scheduling the IBM SP2 with Backfilling. IEEE Transactions on Parallel and Distributed Systems 12(6) (June 2001)Google Scholar
  14. 14.
    Perkovic, D., Keleher, P.: Randomization, Speculation and Adaptation in Batch Schedulers. In: The Proceedings of the IEEE International Conference on Super-computing (November 2000)Google Scholar
  15. 15.
    Ramamritham, K., Stankovic, J.A., Shiah, P.-F.: Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems. IEEE Transactions on Parallel and Distributed Systems 1(2) (April 1990)Google Scholar
  16. 16.
    Talby, D., Feitelson, D.G.: Supporting Priorities and Improving Utilization of the IBM SP2 scheduler using Slack Based Backfilling. In: The Proceedings of the 13th Intl. Parallel Processing Symposium, pp. 513-51 (April 1997)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Mohammad Islam
    • 1
  • Pavan Balaji
    • 1
  • P. Sadayappan
    • 1
  • D. K. Panda
    • 1
  1. 1.Department of Computer and Information ScienceThe Ohio State UniversityColumbusUSA

Personalised recommendations