A Finite-Source Queue with Different Customers

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A Finite-Source Queue with Different Customers

Full text

Pdf (650 KB)

Source

Journal of the ACM (JACM) archive
Volume 29 , Issue 2 (April 1982) table of contents

Pages: 478 - 491

Year of Publication: 1982

ISSN:0004-5411

Author

Hisao Kameda

Department of Computer Science, The University of Electro-Communications, 1-5-1 Chofugaoka, Chofu-shi, Tokyo 182, Japan

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 50, 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/322307.322320 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	Forest Baskett , K. Mani Chandy , Richard R. Muntz , Fernando G. Palacios, Open, Closed, and Mixed Networks of Queues with Different Classes of Customers, Journal of the ACM (JACM), v.22 n.2, p.248-260, April 1975 [doi>10.1145/321879.321887]
	2	John W. Boyse , David R. Warn, A Straightforward Model for Computer Performance Prediction, ACM Computing Surveys (CSUR), v.7 n.2, p.73-93, June 1975 [doi>10.1145/356648.356649]
	3	K. Mani Chandy , John H. Howard, Jr. , Donald F. Towsley, Product Form and Local Balance in Queueing Networks, Journal of the ACM (JACM), v.24 n.2, p.250-263, April 1977 [doi>10.1145/322003.322009]
	4	Cox, D R A use of complex probabditles m the theory of stochastic processes Proc. Cambridge Phil Soc 51 (1955),313-319
	5	Cox, D R, A~D SMITH, W.L Queues Methuen, London, 1961
	6	FELLER, W An Introduction to Probabihty Theory and Its Apphcattons, Vol I Wdey, New York, 1957
	7	FERDINAND, A E An analys,s of the machine interference model IBM Syst J I0, 2 (1971), 129-142
	8	GHANEM, M.Z Study of memory partmomng for muluprogrammmg systems w~th wrtual memory IBM J Res Devel 19, 5 (Sept 1975), 451-457
	9	KELLY, F P Reverstblhty and Stochastw Nel~'orks Wiley, New York, t979
	10	KLEINROCK, L Queuemg Systems, Volume II Computer Apphcatlons Wdey, New York, 1976
	11	KOBAYASHI, 1:1 Modehng and Analysis An lntroduct:on to System Peoformance Evaluation Methodolagy Addtson-Wesley, Reading, Mass, 1978
	12	Andrew S. Noetzel, A Generalized Queueing Discipline for Product Form Network Solutions, Journal of the ACM (JACM), v.26 n.4, p.779-793, Oct. 1979 [doi>10.1145/322154.322166]
	13	RyDeR, K.D.A heunstic approach to task dispatching. IBM Sys~. Z 9, 3 (1970), 189-198.
	14	Scn~ga, A.A. An Analysis of Time-Shared Computer Systems. MIT Press, Cambridge, Mass., 1967.
	15	Spirn, J.R.Multi-queue scheduling of two tasks. Acta Inf. 7, 2 (1976), 21%226.

CITED BY 4

	Y. Liu , O. Johnson, Optimal scheduling policies for mixed scalar-vector multiprocessor supercomputers, Proceedings of the 1988 ACM/IEEE conference on Supercomputing, p.258-265, November 12-17, 1988, Orlando, Florida, United States
	Hisao Kameda, Effects of job loading policies for multiprogramming systems in processing a job stream, ACM Transactions on Computer Systems (TOCS), v.4 n.1, p.71-106, Feb. 1986
	Hisao Kameda, Optimality of scheduling policy for processing a job stream, ACM Transactions on Computer Systems (TOCS), v.2 n.1, p.78-90, February 1984
	Hamed M. K. Alazemi , A. Margolis , J. Choi , R. Vijaykumar , S. Roy, Stochastic modelling and analysis of 802.11 DCF with heterogeneous non-saturated nodes, Computer Communications, v.30 n.18, p.3652-3661, December, 2007