skip to main content
article
Free Access

Feedback coupled resource allocation policies in the multiprogramming-multiprocessor computer system

Published:01 August 1978Publication History
Skip Abstract Section

Abstract

Model studies of some integrated, feedback-driven scheduling systems for multiprogrammed-multiprocessor computer systems are presented. The basic control variables used are the data-flow rates for the processes executing on the CPU. The model systems feature simulated continuous-flow and preempt-resume scheduling of input-output activity. Attention is given to the amount of memory resource required for effective processing of the I/O activity (buffer space assignment). The model studies used both distribution-driven and trace-driven techniques. Even relatively simple dynamic schedulers are shown to improve system performance (as measured by user CPU time) over that given by optimal or near-optimal static schedulers imbedded in identical system structures and workload environments. The improvement is greatest under a heavy I/O demand workload.

References

  1. 1 Bauer, M.J. A simulation approach to the design of dynamic feedback scheduling algorithms for time-shared computer systems. Proc. Second Syrup. on Simulation of Comptr. Syst., Gaithersburg, Md., June 1974, pp. 165-174 (available from ACM). Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2 Bernstein, A.J., and Sharp, J.C. A policy driven scheduler for a time-sharing system. Comm. ACM 11, 2 (Feb. 1971), 74-78. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 Blevins, P.R. Aspects of a dynamically adaptive operating system. Ph.D. Diss., Electr. Eng. Dept., U. of Texas at Austin, Aug. 1972.Google ScholarGoogle Scholar
  4. 4 Brice, R.S. A study of feedback coupled resource allocation policies in a multi-processing computer environment. Ph.D. Diss. Comptr. Sci. Dept., U. of Texas at Austin, Aug. 1973. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5 Buzen, J. Queueing network models of multiprogramming systems. Ph.D. Diss., Harvard U., Cambridge, Mass., May 1971.Google ScholarGoogle Scholar
  6. 6 Coffman, E.G. Jr., and Denning, P.J. Operating System Theory. Prentice-Hall, Englewood Cliffs, N.J., 1973. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7 Howard, J.H. A large-scale dual operating system. Proc. ACM Natl. Conf., Atlanta, Go., 1973, pp. 242-248. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8 Johnson, D.S. A process oriented model of resource demands in a large multiprocessing computer utility. Ph.D. Diss. Comptr. Sci. Dept., U. of Texas at Austin, Aug. 1972. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9 Marshall, B.S. Dynamic calculation of dispatching priorities under OS/360 MVT. Datamation 15, 8 (Aug. 1969), 93.Google ScholarGoogle Scholar
  10. 10 Pewitt, T.C., and Su, S.Y.W. Resource demand paging and dispatching to optimize resource utilization in an operating system. Proc. First SIGME Symp. on Measurement and Evaluation, Palo Alto, Calif., Oct. 1973, pp. 29-36. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11 Ryder, K.D. A heuristic approach to task dispatching. IBM Syst. J. 8 (Oct. 1970), 189.Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12 Sherman, S.W. Trace-driven modeling studies of the performance of computer systems. Ph.D. Diss., U. of Texas at Austin, Aug. 1972; also available as TSN-30, Comput. Ctr. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13 Sherman, S.W., Baskett, F., and Browne, J.C. Trace-driven modeling and analysis of CPU scheduling in a multiprogramming system. Comm. ACM 15, 12 Dec. 1972, 1063-1069. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 14 Sherman, S.W., and Browne, J.C. Trace-driven modeling: Review and overview. Proc. First Syrup. on Simulation of Comptr. Syst. Gaithersburg, Md., June 1973, pp. 201-207. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. 15 Spirn, J. Multiqueue scheduling of two tasks. Proc. Int. Syrup. on Comptr. Performance Modeling, Measurement, and Evaluation, Cambridge, Mass., March 1976, pp. 102-108. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. 16 Stevens, D.F. On overcoming high-priority paralysis in multiprogramming systems. Comm. ACM 11, 8 (Aug. 1968), 539-541. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. 17 Teorey, T.J., and Pinkerton, T.D. A comparative analysis of disk scheduling policies. Comm. ACM 15, 3 (March 1972), 177-184. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Feedback coupled resource allocation policies in the multiprogramming-multiprocessor computer system

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image Communications of the ACM
          Communications of the ACM  Volume 21, Issue 8
          Aug. 1978
          84 pages
          ISSN:0001-0782
          EISSN:1557-7317
          DOI:10.1145/359576
          Issue’s Table of Contents

          Copyright © 1978 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 1 August 1978

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • article

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader