An Approximate Analysis of a UNIX Macro Process Scheduler

Published Online:https://doi.org/10.1287/ijoc.10.3.351

References

  • Bach M. J. The Design of the UNIX Operating System (1986) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
  • Brownie J. Analysis and Simulation of Share Systems (1984) . Honors Thesis Department of Computer Science, University of Sydney, Australia Google Scholar
  • Fayolle G. , Mitrani I. , Iasnogorodski R. Sharing a Processor Among Many Job Classes. Journal of the ACM (1980) 27 3 519 532 CrossrefGoogle Scholar
  • Gelenbe E. , Mitrani I. Analysis and Synthesis of Computer Systems (1980) (Academic Press, London) Google Scholar
  • Henry G. J. The Fair Share Scheduler. AT&T Bell Laboratories Technical Journal (1984) 63 8 1845 1857 CrossrefGoogle Scholar
  • Kay J. , Lauder P. A Fair Share Scheduler. Communications of the ACM (1988) 31 1 44 55 CrossrefGoogle Scholar
  • Kleinrock L. Time-Shared systems: A Theoretical Treatment. Journal of the ACM (1967) 14 2 242 261 CrossrefGoogle Scholar
  • Kleinrock L. Queueing Systems (1976) 2 (John Wiley, New York) Google Scholar
  • Wolff R. W. Poisson Arrivals See Time Averages. Operations Research (1982) 30 223 231 LinkGoogle Scholar
  • Wolff R. W. Stochastic Modeling and the Theory of Queues (1989) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
  • Bazarra M. S. , Sherali H. D. , Shetty C. M. Nonlinear Programming: Theory and Applications (1993) 2nd ed. (John Wiley, New York) Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.