Skip to main content

Deterministic Batch Scheduling without Static Partitioning

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

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1659))

Included in the following conference series:

Abstract

The Irix 6.5 scheduling system provides intrinsic support for batch processing, including support for guaranteed access to resources and policy-based static scheduling. Long range scheduling decisions are made by Miser, a user level daemon, which reserves the resources needed by a batch job to complete its tasks. Short-term decisions are made by the kernel in accordance with the reservations established by Miser. Unlike many batch systems, the processes in a batch job remain in the system from the time originally scheduled until the job completes. This gives the system considerable flexibility in choosing jobs to use idle resources. Unreserved or reserved but unused resources are available to either interactive jobs or batch jobs that haven't yet been scheduled. The system thus gains the advantages of static partitioning and static scheduling, without their inherent costs.

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 39.99
Price excludes VAT (USA)
  • Available as 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. I. Ashok, J. Zahorjan, “Scheduling a Mixed Interactive and Batch Workload on a Parallel, Shared Memory Supercomputer”, Supercomputing 92

    Google Scholar 

  2. man Pages (1M): User Commands, IRIX 6.2, Silicon Graphics 1995

    Google Scholar 

  3. man Pages (1M): User Commands, IRIX 6.5, Silicon Graphics 1998

    Google Scholar 

  4. SubComplex Manager, static partitioning facility by HP. On line documentation: http://www.convex.com/prod serv/exemplar/exemplar scm.html

  5. LoadLeveller, batch scheduler by IBM. On line documentation: http://www.austin.ibm.com/software/sp_products/loadlev.html

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Roussos, K., Bitar, N., English, R. (1999). Deterministic Batch Scheduling without Static Partitioning. In: Feitelson, D.G., Rudolph, L. (eds) Job Scheduling Strategies for Parallel Processing. JSSPP 1999. Lecture Notes in Computer Science, vol 1659. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47954-6_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-47954-6_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66676-9

  • Online ISBN: 978-3-540-47954-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics