A fair share scheduler

ABSTRACT

Central-processing-unit schedulers have traditionally allocated resources fairly among processes. By contrast, a fair Share scheduler allocates resources so that users get their fair machine share over a long period.

REFERENCES

• 1: Maurice J. Bach, The design of the UNIX operating system, Prentice-Hall, Inc., Upper Saddle River, NJ, 1986
• 2: Brownie, J. Analysis and simulation of Share systems. Honors thesis, Computer Science Dept., Univ. of Sydney, Australia, 1984.
• 3: Coffman, E.G., Jr., and Kleinrock, L. Computer scheduling methods and their countermeasures. In Proceedings of the Spring Joint Computer Conference, vol. 32 (Atlantic City, N.J., Apr. 30-May 2). AFIPS Press, Reston, Va., 1968, pp. 11-21.
• 4: Heidelberger, P., and Lavenberg, S.S. Computer performance evaluation methodology. IEEE Trans. Comput. C-33, 12 (Dec. 1984), 1195- 1220.
• 5: Henry, G.J. The fair share scheduler. Bell Syst. Tech. J. 63, 8, Part 2 (Oct. 1984), 1845-1857.
• 6: Hume, A. A Share scheduler for Unix. AUUG Newsl., Australian UNIX User's Group, Sydney, Australia, 1979.
• 7: Kay, J., Lauder P., Maltby, C., and Tollasepp S. The Share charging and scheduling system~ Tech. Rep. 174, Basser Dept. of Computer Science, Univ. of Sydney, Australia, May 1982.
• 8: Jack P. C. Kleijnen , Anton J. van Reeken, Principles of computer charging in a university-type organization, Communications of the ACM, v.26 n.11, p.926-932, Nov. 1983 [doi>10.1145/182.358448]
• 9: Kleinrock, L. A continuum of time-sharing scheduling algorithms. In Proceedings of the AFIPS Spring Joint Computer Conference, vol. 36 (Atlantic City, N.J., May 5-7). AFIPS Press, Reston, Va.. 1970, pp. 453-458.
• 10: Butler W. Lampson, A scheduling philosophy for multiprocessing systems, Communications of the ACM, v.11 n.5, p.347-360, May 1968 [doi>10.1145/363095.363144]
• 11: Larmouth, I. Scheduling for a share of the machine. Softw. Pract. Exper. 5, I (Jan. 19751, 29-49.
• 12: Larmouth, J. Scheduling for immediate turnaround. Softw. Pract. Exper. 8, 5 (Sept.-Oct. 1978), 559-578.
• 13: Lauder, P. Share scheduling works! AUUG News. 1980.
• 14: Lynn J. McKell , James V. Hansen , Lester E. Heitger, Charging for Computing Resources, ACM Computing Surveys (CSUR), v.11 n.2, p.105-120, June 1979 [doi>10.1145/356770.356775]
• 15: Newbury, J.P. Immediate turnround--An elusive goal. Softw. Pract. Exper. 12, 10 (Oct. 1982) 897-906.
• 16: Norman R. Nielsen, The allocation of computer resources—is pricing the answer?, Communications of the ACM, v.13 n.8, p.467-474, Aug. 1970 [doi>10.1145/362705.362707]
• 17: Ritchie, D.M., and Thompson, K. The UNIX timesharing system. Bell Syst. Tech. J. 57, 6 (July-Aug. 1978), 1905-1929.
• 18: Tollasepp, S. The SHARE resource allocation system. Honors thesis, Computer Science Dept., Univ. of Sydney, Australia, 1981.
• 19: C M Woodside, Controllability of computer performance tradeoffs obtained using controlled-share queue schedulers, IEEE Transactions on Software Engineering, v.12 n.10, p.1041-1048, Oct. 1986

INDEX TERMS

Primary Classification:
  K. Computing Milieux
  K.6 MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS
      K.6.2 Installation Management
          Subjects: Performance and usage measurement

Additional Classification:
  C. Computer Systems Organization
  C.4 PERFORMANCE OF SYSTEMS
      Subjects: Performance attributes

  D. Software
  D.4 OPERATING SYSTEMS
      D.4.1 Process Management
          Subjects: Scheduling

General Terms:
Management, Measurement, Performance