Article

Free access

Preemption costs in round robin scheduling

Author:

Charles M. ShubAuthors Info & Claims

ACM '78: Proceedings of the 1978 annual conference - Volume 2

Pages 868 - 874

https://doi.org/10.1145/800178.810156

Published: 01 January 1978 Publication History

PDF eReader

Abstract

Round robin scheduling with preemption costs taken into consideration is examined. Both a uniprocessor configuration and a multiprocessor configuration, one processor dedicated to the scheduling, are considered. Approximation formulae to obtain effective load on the system from the actual load and the overhead parameters are derived and compared with simulation results.

References

[1]

_____, Analysis of Some Queueing Models in Real Time Systems, IBM Document GF20-007-1.

Google Scholar

[2]

Babad, J. M., A Generalized Multi-Entrance Time-Sharing Priority Queue, Journal of the A.C.M., Volume 22, No. 2, April 1975, pp. 231-248.

Digital Library

Google Scholar

[3]

Bernstein, A. J. and J. C. Sharp, A Policy Driven Scheduler for a Time Sharing System, Communications of the A.C.M., Volume 14, No. 2, February 1971, pp. 74-78.

Digital Library

Google Scholar

[4]

Coffman, Edward G., Jr., On the Trade-off Between Response and Preemptive Costs in a Foreground Background Computer Service Discipline, IEEE Transactions on Computers, Volume C 18, No. 10, October 1969, pp. 942-947.

Google Scholar

[5]

Coffman, Edward G., Jr. and Peter J. Denning, Operating Systems Theory, Prentice-Hall, Englewood Cliffs, New Jersey, 1973.

Digital Library

Google Scholar

[6]

Gordon, Geoffrey, System Simulation, (second edition), Prentice-Hall, Englewood Cliffs, New Jersey, 1978.

Digital Library

Google Scholar

[7]

Mullery, A. P. and G. C. Driscoll, A Processor Allocation Method for Time-Sharing, Communications of the A.C.M., Volume 13, No. 1, January 1970, pp. 10-14.

Digital Library

Google Scholar

[8]

Shannon, Robert E., Systems Simulation: The Art and the Science, Prentice-Hall, Englewood Cliffs, New Jersey, 1975

Google Scholar

[9]

Sherman, Steven, Forest Baskett, III and J. C. Browne, Trace-Driven Modeling and Analysis of CPU Scheduling in a Multiprogramming System, Communications of the A.C.M., Volume 15, No. 12, December 1972, pp. 1063-1069.

Digital Library

Google Scholar

[10]

Shub, Charles M. and William G. Bulgren, A Stable Time Independent Queue Model for Studying the Effects of Overhead in Computing Systems, Proceedings of the 1975 Summer Computer Simulation Conference, San Francisco, California, July 1975.

Google Scholar

[11]

Shub, Charles M., Simulation Studies on the Effect of Overhead in Computing Systems, Proceedings of the Ninth Annual Simulation Symposium, Tampa, Florida, March 1976.

Google Scholar

Index Terms

Preemption costs in round robin scheduling
1. Computing methodologies
  1. Modeling and simulation
    1. Model development and analysis
      1. Model verification and validation
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Scheduling algorithms
    2. Online algorithms
      1. Online learning algorithms
        Scheduling algorithms
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning
        Sequential decision making

Recommendations

A proposed priority dynamic quantum time algorithm to enhance varying time quantum round robin algorithm

Management of the processes is an essential task performed by the scheduler in an Operating System OS. One of the important units of the OS is Central Processing Unit CPU, which is scheduling by many algorithms of scheduling. The main purpose of these ...
The efficiency-fairness balance of Round Robin scheduling
Abstract
Round Robin is a widely used scheduling policy, used primarily because it is intuitively fair, splitting the resources evenly among the jobs. Little is known, however, of its fairness with respect to completion times for the jobs, ...
Executed-time Round Robin

Energy conservation has become a prime objective due to excess use and huge demand of energy in data centers. One solution is to use efficient job scheduling algorithms. The scheduler has to maintain the machine's state balance to obtain efficient job ...

Comments

Information & Contributors

Information

Published In

ACM '78: Proceedings of the 1978 annual conference - Volume 2

January 1978

990 pages

ISBN:0897910001

DOI:10.1145/800178

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: 01 January 1978

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
463
Total Downloads

Downloads (Last 12 months)45
Downloads (Last 6 weeks)6

Reflects downloads up to 10 Oct 2024

Other Metrics

View Author Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

Abstract

References

Index Terms

Recommendations

A proposed priority dynamic quantum time algorithm to enhance varying time quantum round robin algorithm

The efficiency-fairness balance of Round Robin scheduling

Executed-time Round Robin

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations