Skip to main content
SpringerLink
Log in

Job scheduling under the Portable Batch System

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

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

Included in the following conference series:

Abstract

The typical batch queuing system schedules jobs for execution by a set of queue controls. The controls determine the queue from which jobs will be selected. Within each queue, jobs are typically selected in first-in, first-out (FIFO) order. This limits the set of scheduling policies available to a site.

The Portable Batch System (PBS) removes this limitation by providing an external scheduling module. This separate program has full knowledge of the available queued jobs, running jobs, and system resource usage. Sites are able to implement any policy expressible in one of several procedural languages. Policies may range from “best fit” to “fair share” to purely political. Scheduling decisions can be made over the full set of jobs regardless of queue or order. The scheduling policy can be changed to fit a wide variety of computing environments and scheduling goals. This is demonstrated by the use of PBS on an IBM SP-2 system at NASA Ames.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kingsbury, B. “The Network Queuing System”, Sterling Software, Palo Alto.

    Google Scholar 

  2. Mutka, M. “Sharing in a Privately Owned Workstation Environment.” Ph.D. thesis, University of Wisconsin, May 1988.

    Google Scholar 

  3. Litzkow, M., Livny. M. and Mutka, M. “Condor—A Hunter of Idle Workstation”. Proceeding of the 8th International Conference on Distributed Computing Systems. San Jose, CA. June 1988.

    Google Scholar 

  4. Duke, D., Green, T., and Pasko, J. “Research Toward a Heterogeneous Networked Computing Cluster: The Distributed Queuing System Version 3.0”. Supercomputing Computations Research Institute, Florida State University, March 2, 1994.

    Google Scholar 

  5. Zhou, S., Zheng, X., Wang, J., and Delisle P. “Utopia: a Load Sharing Facility for Large, Heterogeneous Distributed Computer Systems” Software — Practice and Experience, Volume 23, December 1993.

    Google Scholar 

  6. Ousterhout, J., “Tcl and the Tk Toolkit”. Addison-Wesley Publishing. 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Sciences Corporation, NASA Contract NAS 2-12961, 94035-1000, Moffett Field, CA

    Robert L. Henderson

Authors
  1. Robert L. Henderson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Dror G. Feitelson Larry Rudolph

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Henderson, R.L. (1995). Job scheduling under the Portable Batch System. In: Feitelson, D.G., Rudolph, L. (eds) Job Scheduling Strategies for Parallel Processing. JSSPP 1995. Lecture Notes in Computer Science, vol 949. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60153-8_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-60153-8_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60153-1

  • Online ISBN: 978-3-540-49459-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation