Busy Period Analysis of a Time-Sharing System Modeled as a Semi-Markov Process

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Busy Period Analysis of a Time-Sharing System Modeled as a Semi-Markov Process

Full text

Pdf (826 KB)

Source

Journal of the ACM (JACM) archive
Volume 18 , Issue 2 (April 1971) table of contents

Pages: 221 - 238

Year of Publication: 1971

ISSN:0004-5411

Authors

U. Narayan Bhat	Institute of Technology, Computer Science/Operations Research Center, Southern Methodist University, Dallas, Texas
Richard E. Nance	Institute of Technology, Computer Science/Operations Research Center, Southern Methodist University, Dallas, Texas

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 23, Citation Count: 4

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/321637.321643 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Norman R. Nielsen, The simulation of time sharing systems, Communications of the ACM, v.10 n.7, p.397-412, July 1967 [doi>10.1145/363427.363436]
	2	REHMAN, S. L., AND GANGWERE, S. G., JR. A simulation study of resource management in a time-sharing system," Proc. AFIPS 1968 FJCC, 33(2), pp. 1411-1430.
	3	FINE, G. H., AND MclsAAc, P.V. Simulation of a time-sharing system. Manag. 8ci. 12, 6 (Feb. 1966), B180-B194.
	4	B. Krishnamoorthi , Roger C. Wood, Time-Shared Computer Operations With Both Interarrival and Service Times Exponential, Journal of the ACM (JACM), v.13 n.3, p.317-338, July 1966 [doi>10.1145/321341.321342]
	5	CHANG, WEI Queues with feedback for time-sharing computer system analysis. Oper. Res. 16, 3 (May-June 1968), 613-627.
	6	I. Adiri , B. Avi-Itzhak, A Time-Sharing Queue with a Finite Number of Customers, Journal of the ACM (JACM), v.16 n.2, p.315-323, April 1969 [doi>10.1145/321510.321523]
	7	D. P. Gaver, Jr., Probability Models for Multiprogramming Computer Systems, Journal of the ACM (JACM), v.14 n.3, p.423-438, July 1967 [doi>10.1145/321406.321407]
	8	COFFMAN, E.G. Markov chain analysis of multiprogrammed computer systems. Naval Res. Logist. Quart. 16, 2 (June 1969), 175-197.
	9	KLEINROCK, L. Analysis of a time-shared processor. Naval Res. Logist. Quart. 11, 1 (Mar. 1964), 59-73.
	10	PYKE, R. A. Markov renewal processes: Definitions and preliminary properties. Ann. Math. Statist. 32 (196'), 1231-1242.
	11	PYKE, R. A. Markov renewal processes with finitely many states. Ann. Math. Statist. 32 (1961), 1243-1259.
	12	Cox, D.R. Renewal Theory. Methuen, London, 1962.
	13	WIDDER, D.V. The Laplace Transform. Princeton U. Press, Princeton, N. J., 1946.

CITED BY 4

	Richard E. Nance , U. Narayan Bhat , Billy G. Claybrook, Busy Period Analysis of a Time-Sharing System: transform inversion, Journal of the ACM (JACM), v.19 n.3, p.453-463, July 1972
	U. Narayan Bhat , Richard E. Nance, An Evaluation of CPU Efficiency Under Dynamic Quantum Allocation, Journal of the ACM (JACM), v.26 n.4, p.761-778, Oct. 1979
	S. Haldar , D. K. Subramanian, Fairness in processor scheduling in time sharing systems, ACM SIGOPS Operating Systems Review, v.25 n.1, p.4-18, Jan. 1991
	M. A. Sencer , C. L. Sheng, An analysis of multiprogrammed time-sharing computer systems, Proceedings of the June 4-8, 1973, national computer conference and exposition, June 04-08, 1973, New York, New York