article

Free access

On the optimization of performance of time-sharing systems by simulation

Authors:

J. Blatny,

S. R. Clark,

T. A. RourkeAuthors Info & Claims

Communications of the ACM, Volume 15, Issue 6

Pages 411 - 420

https://doi.org/10.1145/361405.361406

Published: 01 June 1972 Publication History

PDF eReader

Abstract

A simulation model of a time-sharing system with a finite noncontiguous store and an infinite auxiliary store is used to study the variation of system parameters such as store size, number of jobs allowed to execute simultaneously, job-scheduling algorithm, etc. The effects of these variations on a measure of system performance is used to ascertain which of the parameters controllable by the job-scheduling algorithm, including the scheduling itself, require optimization, and which of the parameters not normally controllable by the scheduling algorithm have a marked effect on system performance. System performance is based upon the mean cost of delay to all jobs processed.

It is shown that significant improvements in the measure of system performance can be obtained by using variable time-slice techniques and by selecting the optimum round-robin cycle time. It appears that these features would benefit from optimization whereas other parameters controllable by the scheduling algorithm affect system performance in a predictable manner and would not benefit from optimization.

Features not normally under the control of the scheduling algorithm can also have a marked effect on the measure of performance; in particular, supervisor overheads, the size of the store, and the speed of the CPU.

A comparison is made between the results of the simulation model and two analytical equations for quantum-oriented nonpreemptive time-sharing systems. The comparison is found to be very favorable.

References

[1]

Greenberger, M. The priority problem and computer timesharing. Management Science 12 (July 1966), 888-906.

Digital Library

Google Scholar

[2]

Rasch, P.J. A queueing theory study of round-robin scheduling of time-sharing computer systems. J. ACM 17 (Jan. 1970), 131-145.

Digital Library

Google Scholar

[3]

Fine, G.H., and Mclsaac, P.V. Simulation of a time-sharing system. Management Science 12 (Feb. 1966), 180-194.

Digital Library

Google Scholar

[4]

Fife, D.W. An optimization model for time-sharing. Proc. AFIPS 1966 SJCC, Vol. 28, Spartan Books, New York, 97-104.

Google Scholar

[5]

Hume, J.N.P., and Rolphson, C.B. Scheduling for fast turnaround in job-at-a-time processing. Proc. IFIP Congress 68, July 1968. E60-64 Preliminary Ed.

Google Scholar

[6]

Arden, B., and Boettner, D. Measurement and performance of a multiprogramming system. Second ACM Symposium on Operating Systems Principles, Princeton U. 1969, 130-146.

Digital Library

Google Scholar

[7]

Morris, D., Summer, F.H., and Wyld, M.T. An appraisal of the Atlas supervisor. Proc. ACM 22nd Nat. Conf., 1967, Psychonetics, Narbeth, Pa., 67-75.

Digital Library

Google Scholar

[8]

Coffman, E.G., and Kleinrock, L. Computer scheduling methods and their countermeasures. Proc. AFIPS 1968 SJCC, Vol. 32, AFIPS Press, Montvale, N.J.

Google Scholar

[9]

Kleinrock, L. Time-shared systems, a theoretical treatment. J. ACM 14 (Apr. 1967), 242-261.

Digital Library

Google Scholar

[10]

Abate, J., Dubner, H., and Weinberg, S.B. Queueing analysis of the IBM 2314 disk storage facility. J. ACM 15 (Oct. 1968), 577-589.

Digital Library

Google Scholar

[11]

Fishman, G.S., and Kiviat, P.J. The statistics of discreteevent simulation. Simulation 10 (Apr. 1968), 185-195.

Crossref

Google Scholar

[12]

Fishman, G.S., and Kiviat, P.J. The analysis of simulationgenerated time series. Management Science 13 (Mar. 1967), 525-557.

Digital Library

Google Scholar

[13]

Stimler, S. Some criteria for time-sharing system performance. Comm. ACM 12, 1 (Jan. 1969), 47-53.

Digital Library

Google Scholar

Cited By

View all

Rourke TClark S(2016)Testing an Autoregressive Approach for The Estimation of Sample Mean Variance in Discrete-Event SimulationsINFOR: Information Systems and Operational Research10.1080/03155986.1977.1173165515:1(62-71)Online publication date: 25-May-2016
https://doi.org/10.1080/03155986.1977.11731655
Rourke TClark S(2016)Applications Of A Heterogeneous Approach To The Simulation Of Computer SystemsINFOR: Information Systems and Operational Research10.1080/03155986.1976.1173164114:3(212-226)Online publication date: 25-May-2016
https://doi.org/10.1080/03155986.1976.11731641
Haá A(2006)Computer system simulation in PascalSoftware: Practice and Experience10.1002/spe.438012080712:8(777-784)Online publication date: 27-Oct-2006
https://doi.org/10.1002/spe.4380120807
Show More Cited By

Recommendations

Modified Rate-Monotonic Algorithm for Scheduling Periodic Jobs with Deferred Deadlines

The deadline of a request is the time instant at which its execution must complete. The deadline of the request in any period of a job with deferred deadline is some time instant after the end of the period. The authors describe a semi-static priority-...
Preference-oriented real-time scheduling and its application in fault-tolerant systems

Investigate the preference-oriented executions for real-time tasks.Propose two optimal preference-oriented (PO) scheduling algorithms.Explore the application of PO scheduling algorithms for fault tolerant systems.PO scheduling algorithms can effectively ...
Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems

Efficient scheduling algorithms based on heuristic functions are developed for scheduling a set of tasks on a multiprocessor system. The tasks are characterized by worst-case computation times, deadlines, and resources requirements. Starting with an ...

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 15, Issue 6

June 1972

69 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/361405

Editor:
M. Stuart Lynn
Rice Univ., Houston, TX

Issue’s Table of Contents

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 June 1972

Published in CACM Volume 15, Issue 6

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

16
Total Citations
View Citations
312
Total Downloads

Downloads (Last 12 months)55
Downloads (Last 6 weeks)5

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Rourke TClark S(2016)Testing an Autoregressive Approach for The Estimation of Sample Mean Variance in Discrete-Event SimulationsINFOR: Information Systems and Operational Research10.1080/03155986.1977.1173165515:1(62-71)Online publication date: 25-May-2016
https://doi.org/10.1080/03155986.1977.11731655
Rourke TClark S(2016)Applications Of A Heterogeneous Approach To The Simulation Of Computer SystemsINFOR: Information Systems and Operational Research10.1080/03155986.1976.1173164114:3(212-226)Online publication date: 25-May-2016
https://doi.org/10.1080/03155986.1976.11731641
Haá A(2006)Computer system simulation in PascalSoftware: Practice and Experience10.1002/spe.438012080712:8(777-784)Online publication date: 27-Oct-2006
https://doi.org/10.1002/spe.4380120807
Gomaa H(2006)The calibration and validation of a hybrid simulation/regression model of a batch computer systemSoftware: Practice and Experience10.1002/spe.43800801038:1(11-28)Online publication date: 27-Oct-2006
https://doi.org/10.1002/spe.4380080103
Beilner H(2005)Die Methode der ausgewogenen Abweicung; ein Hilfsmittel zur zielstrebigen Leistungsverbesserung von RechensystemenGI Gesellschaft für Informatik e. V. 3. Jahrestagung Hamburg, 8.–10. Oktober 197310.1007/3-540-06473-7_30(281-291)Online publication date: 24-May-2005
https://doi.org/10.1007/3-540-06473-7_30
Hac A(1988)A multiprocessor model with classes of processes and prioritiesJournal of Systems and Software10.1016/0164-1212(88)90023-48:3(247-251)Online publication date: 1-Jun-1988
https://dl.acm.org/doi/10.1016/0164-1212%2888%2990023-4
Tsay PNg P(1980)A simulation approach to the comparative analysis of various job scheduling methodsInformation Sciences10.1016/0020-0255(80)90009-221:1(31-58)Online publication date: Jun-1980
https://doi.org/10.1016/0020-0255(80)90009-2
ADAM NDOGRAMACI A(1979)ISSUES IN SIMULATION LANGUAGES: A BRIEF OVERVIEWCurrent Issues in Computer Simulation10.1016/B978-0-12-044120-4.50006-4(3-14)Online publication date: 1979
https://doi.org/10.1016/B978-0-12-044120-4.50006-4
Sergienko ISkopetskii V(1978)Performance-improvement research for data-processing systemsCybernetics10.1007/BF0106885113:6(856-867)Online publication date: 1978
https://doi.org/10.1007/BF01068851
Farrell WSargent RSchmidt JSpeigel MRoth PTorrence SDelfosse CHull L(1977)Literature review bibliography of simulation optimitationProceedings of the 9th conference on Winter simulation - Volume 110.5555/800251.807530(116-124)Online publication date: 5-Dec-1977
https://dl.acm.org/doi/10.5555/800251.807530
Show More Cited By

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

Cited By

Recommendations

Modified Rate-Monotonic Algorithm for Scheduling Periodic Jobs with Deferred Deadlines

Preference-oriented real-time scheduling and its application in fault-tolerant systems

Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations