A fair share job scheduling approach for MVS

  • Authors:
  • L. Dean Conrad;C. Jack Hsu

  • Affiliations:
  • -;-

  • Venue:
  • ACM SIGUCCS Newsletter
  • Year:
  • 1989

Quantified Score

Hi-index 0.00

Visualization

Abstract

One of the more challenging problems to handle in a university computing center is how to schedule the use of scarce computing resources fairly among the various elements of the customer community. The researcher community on our campus does a good job of monitoring for possible "holes" in our resource allocation schemes that might be exploited to the benefit of some ... and the detriment of others. This paper discusses the MVS scheduling problem we encountered and describes the approach taken to solve it.