Skip to main content
SpringerLink
Log in

Multi-queue scheduling of two tasks

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

Scheduling in the central server queueing model, consisting of a “CPU” server and m “I/O” servers, is considered for the case of two customers. Optimal (maximal CPU utilization) CPU and I/O schedules are obtained. The best CPU schedule depends on the I/O schedule in effect; and is either Longest or Shortest-Expected-Remaining-Processing-Time-First. However, for certain I/O schedules the CPU schedule is immaterial. The best I/O schedule is always to process the longer CPU customer first.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Chandy, K. M.: The analysis and solutions for general queueing networks. Proc. 6th Princeton Conference on Information Sciences and Systems, Princeton (N.J.), March 1972

  2. Baskett, F., Chandy, K. M., Muntz, R. R., Palacios, F. G.: Open, closed, and mixed networks of queues with different classes of customers. J. ACM 22, 248–260 (1975)

    Google Scholar 

  3. Schrage, L.: A proof of the optimality of the shortest remaining processing time discipline. Operations Research 16, 687–690 (1968)

    Google Scholar 

  4. Price, T. G.: An analysis of central processor scheduling in multiprogrammed computer systems. Stanford University, Digital Systems Lab, Technical Report #57, October 1972

  5. Lazowska, E. D.: Scheduling multiple resource computer systems. Computer Systems Research Group, University of Toronto, Technical Report CSRG-32, M. Sc. Thesis, May 1974

  6. Lazowska, E. D., Sevcik, K. C.: Scheduling in systems with two scarce resources. Proc. ACM Nat'1. Conf. San Diego (Calif.), Nov. 1974 p. 66–73

  7. Buzen, J. P.: Queueing network models of multiprogramming. Harvard University, Division of Eng. and Appl. Science, Ph. D. Thesis, May 1971

  8. Spirn, J. R.: A model for dynamic allocation in a paging machine. Proc. 8th Princeton Conf. on Information Sciences and Systems, Princeton (N.J.), March 1974, p. 331–334

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, The Pennsylvania State University, 16802, University Park, Pa., USA

    Jeffrey R. Spirn

Authors
  1. Jeffrey R. Spirn
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Spirn, J.R. Multi-queue scheduling of two tasks. Acta Informatica 7, 217–226 (1976). https://doi.org/10.1007/BF00265772

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation