• Colin J. Theaker
  • Graham R. Brookes
Part of the Macmillan Computer Science Series book series (COMPSS)


The organisation of the operating system outlined in chapter 2 allows for the time-sharing of the CPU between a number of processes. This technique, however, poses a number of problems; most notably, sharing the available resources between the different job processors. The allocation of resources is the most significant problem faced by an operating system, and one of the most important resource is CPU time. In this chapter, we shall examine the problems of allocating CPU time between the different processes, and some of the basic principles involved in job scheduling.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

4.7 References and bibliography

  1. R.B. Bunt (1976). ‘Scheduling Techniques for Operating Systems’, Computer, Vol. 9, No. 10, pp. 10–17.CrossRefGoogle Scholar
  2. E.G. Coffman and P.J. Denning (1973). ‘Operating Systems Theory’, Prentice-Hall, Englewood Cliffs, New Jersey.Google Scholar
  3. L. Kleinrock (1975). ‘Queuing Systems, Vol II: Computer Applications’, Wiley-Interscience, New York.Google Scholar
  4. S. Lauesen (1975). ‘Job Scheduling Guaranteeing Reasonable Turnaround Times’, Acta Informatica, Vol. 2, No. 1, pp. 1–11.CrossRefGoogle Scholar
  5. M. Ruschizka and R.S. Fabry (1977). ‘A Unifying Approach to Scheduling’, Communications of the ACM, Vol. 20, No. 7, pp. 469–77.CrossRefGoogle Scholar

Copyright information

© Colin J. Theaker and Graham R. Brookes 1993

Authors and Affiliations

  • Colin J. Theaker
    • 1
  • Graham R. Brookes
    • 2
  1. 1.Staffordshire UniversityUK
  2. 2.Hull UniversityUK

Personalised recommendations