Sequential Processing Machines (S.P.M) Analyzed With a Queuing Theory Model

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Sequential Processing Machines (S.P.M) Analyzed With a Queuing Theory Model

Full text

Pdf (813 KB)

Source

Journal of the ACM (JACM) archive
Volume 13 , Issue 2 (April 1966) table of contents

Pages: 179 - 193

Year of Publication: 1966

ISSN:0004-5411

Author

Leonard Kleinrock

University of California, Los Angeles, California

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 23, Citation Count: 9

Additional Information:

abstract 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/321328.321329 What is a DOI?

ABSTRACT

Results are obtained for a model of many processors operating in series. The results are obtained directly by recognizing that a sequential processing may be viewed as a cyclic queue. Exact results are given for two sequential processing stages with a buffer storage of arbitrary size between the stages, and approximate results for the case of 2M (M an integer) stages. The analysis is good only for exponentially distributed computation times.

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	AOKi, M., ESTaI, G., AND MANDELL, R. A probabilistie analysis of computing load assignment in a multi-processor computing system. Proe. Fall Joint Comput. Conf. 1963, 147-160.
	2	ESTRIN, G., BUSSELL, B., TYRO, R., AND BmB, J. Parallel processing in a restructurable computer system. Trans. IEEE EC-12, 6 (Dee. 1963), 747-755.
	3	ESTEIN, G. AND TUR, R. Automatic assignment of computations in a variable structure computer system. Trans. IEEE EC-12, 6 (Dee. 1963), 755-773.
	4	KOESmSBERG, E. Cyclic queues. Oper. Res. Quart. 9, 1 (1958).

CITED BY 9

	Micha Hofri , Micha Yadin, A Processor in Series with Demand-Interrupting Devices—A Stochastic Model, Journal of the ACM (JACM), v.22 n.2, p.270-290, April 1975
	J. L. Baer, A Survey of Some Theoretical Aspects of Multiprocessing, ACM Computing Surveys (CSUR), v.5 n.1, p.31-80, March 1973
	W. Chang , Y. J. Paternot , J. A. Ray, Throughput analysis of computer systems - multiprogramming versus multiprocessing, Proceedings of the SIGOPS workshop on System performance evaluation, p.59-81, January 1971
	N. S. Losapio , William G. Bulgren, Simulation of dispatching algorithms in a multiprogramming environment, Proceedings of the ACM annual conference, p.903-913, August 01-01, 1972, Boston, Massachusetts, United States
	R. R. Muntz , E. G. Coffman, Jr., Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems, Journal of the ACM (JACM), v.17 n.2, p.324-338, April 1970
	J. M. McKinney, A Survey of Analytical Time-Sharing Models, ACM Computing Surveys (CSUR), v.1 n.2, p.105-116, June 1969
	G. Estrin , L. Kleinrock, Measures, models and measurements for time-shared computer utilities, Proceedings of the 1967 22nd national conference, p.85-96, January 1967, Washington, D.C., United States
	Edward G. Coffman, Jr , Leonard Kleinrock, Computer scheduling methods and their countermeasures, Proceedings of the April 30--May 2, 1968, spring joint computer conference, April 30-May 02, 1968, Atlantic City, New Jersey
	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