Skip to main content

The EASY — LoadLeveler API project

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

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

Included in the following conference series:

Abstract

With the increasing use of distributed memory massively parallel machines (MPPs) such as the IBM SP, the need for improved parallel job scheduling tools has sparked many recent developments. IBM's LoadLeveler is being used at the Cornell Theory Center, but problems exist with the current scheduling algorithm applied to the job mix on the 512-node SP. In order to address Cornell's difficulties, Joseph Skovira began to consider enhancements to LoadLeveler. At about the same time, David Lifka, developer of the EASY parallel job scheduler, began working at CTC. With Waiman Chan and Honbo Zhou of IBM LoadLeveler development, we have developed a LoadLeveler API that allows external schedulers like EASY to control the starting and stopping of jobs through LoadLeveler.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kaplan, J., Nelson, M., A Comparison of Queueing, Cluster and Distributed Computing Systems. NASA TM 109025 (Revision 1)-1, NASA Langly Research Center, (1994)

    Google Scholar 

  2. Lifka, D., Henderson, M.,and Rayl, K., ANL/MCS-TM-201, Users Guide to the Argonne SP Scheduling System, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL (1995)

    Google Scholar 

  3. Lifka, D., The ANL/IBM SP Scheduling System, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL (1995)

    Google Scholar 

  4. Rosenkrantz, M., Schneider, D., Leibensperger, R., Shore, M., Zollweg, J., Requirements of the Cornell Theory Center for Resource Management and Process Scheduling, Cornell Theory Center, Ithaca NY (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Dror G. Feitelson Larry Rudolph

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Skovira, J., Chan, W., Zhou, H., Lifka, D. (1996). The EASY — LoadLeveler API project. In: Feitelson, D.G., Rudolph, L. (eds) Job Scheduling Strategies for Parallel Processing. JSSPP 1996. Lecture Notes in Computer Science, vol 1162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022286

Download citation

  • DOI: https://doi.org/10.1007/BFb0022286

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61864-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics