Busy Period Analysis of a Time-Sharing System

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Busy Period Analysis of a Time-Sharing System: transform inversion

Full text

Pdf (682 KB)

Source

Journal of the ACM (JACM) archive
Volume 19 , Issue 3 (July 1972) table of contents

Pages: 453 - 463

Year of Publication: 1972

ISSN:0004-5411

Authors

Richard E. Nance	Southern Methodist University, Dallas, Texas
U. Narayan Bhat	Southern Methodist University, Dallas, Texas
Billy G. Claybrook	Southern Methodist University, Dallas, Texas

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 17, Citation Count: 3

Additional Information:

references cited by index terms collaborative colleagues peer to peer

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/321707.321716 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	U. Narayan Bhat , Richard E. Nance, Busy Period Analysis of a Time-Sharing System Modeled as a Semi-Markov Process, Journal of the ACM (JACM), v.18 n.2, p.221-238, April 1971 [doi>10.1145/321637.321643]
	2	PYKE, R. A. Markov renewal processes: definitions and preliminary properties. Ann. Math. Star. 32 (1961), 1231-1242.
	3	PYKE, R.A. Markov renewal processes with finitely many states. Ann. Math. Star. 32 (1961), 1243-1259.
	4	GAwm, D. P., JR. Observing stochastic processes and approximate transform inversion. Oper. Res. 1~, 3 (May-June 1966), 444-459.
	5	Harald Stehfest, Algorithm 368: Numerical inversion of Laplace transforms [D5], Communications of the ACM, v.13 n.1, p.47-49, Jan. 1970 [doi>10.1145/361953.361969]
	6	William T. Weeks, Numerical Inversion of Laplace Transforms Using Laguerre Functions, Journal of the ACM (JACM), v.13 n.3, p.419-429, July 1966 [doi>10.1145/321341.321351]
	7	H. Dubner , J. Abate, Numerical Inversion of Laplace Transforms by Relating Them to the Finite Fourier Cosine Transform, Journal of the ACM (JACM), v.15 n.1, p.115-123, Jan. 1968 [doi>10.1145/321439.321446]
	8	CHiu, R. F., CHEN, C. F., AND HUANG, C .J . A new method for the inverse Laplace transformation via the fast Fourier transform. Twenty-Second Southwestern IEEE Conf. Record, Dallas, Texas, 1970, pp. 201-203.
	9	BELLMAN, R. E., KALABA, R. E., AND LOCKETT, J .A . Numerical Inversion of the Laplace Transform. American Elsevier, New York, 1966.
	10	BHAT, U.N. Sixty years of queueing theory. Manag. Sci. 15, 6 (Feb. 1969), B280-B294.

CITED BY 3

	A. M. K. Tarabia, A new formula for the busy period of a non-empty multiserver queueing system, Applied Mathematics and Computation, v.143 n.2-3, p.401-408, 10 November 2003
	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
	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