Maximum Processing Rates of Memory Bound Systems

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Maximum Processing Rates of Memory Bound Systems

Full text

Pdf (831 KB)

Source

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

Pages: 461 - 477

Year of Publication: 1982

ISSN:0004-5411

Author

R. M. Bryant

IBM Thomas J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 22, Citation Count: 6

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.322319 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	A. K. Agrawala , R. M. Bryant, Models of memory scheduling, Proceedings of the fifth ACM symposium on Operating systems principles, p.217-222, November 19-21, 1975, Austin, Texas, United States
	2	BADEL, M., G~ELENBE, E., LEROUDIER, $., AND PortzS, D. Adaptive optimization of a time-sharing system's performance. Proc. IEEE 63, 5 (June 1975), 958-965.
	3	BARD, Y An analytic model of CP-67 and VM/370. IBM Res. Rep. G320-2101, Cambridge Scientific Center, Cambridge, Mass., 1974
	4	BETTERIDGE, T.An analytic storage allocation model. Acta Inf. 3 (1974), 101-122.
	5	BgAtCDWAJN, A,A model of a time-sharing virtual memory system solved using eqmvalence and decomposition methods. A cta Inf. 4 (1974), 11-47
	6	BRANDWMN, A.A model of a virtual memory system. Acta Inf 6 (1976), 365-386.
	7	Alexandre Brandwajn, A Queueing Model of Multiprogrammed Computer Systems Under Full Load Conditions, Journal of the ACM (JACM), v.24 n.2, p.222-240, April 1977 [doi>10.1145/322003.322007]
	8	R. M. Brown , J. C. Browne , K. M. Chandy, Memory management and response time, Communications of the ACM, v.20 n.3, p.153-165, March 1977 [doi>10.1145/359436.359443]
	9	Raymond Morris Bryant, The storage limited exponential queue and applications to finite memory size models of computer systems., 1978
	10	BRYANT, R.M. Maximum processing rates of memory bound systems. Tcch. Rep. 362, Computer Sciences Dep., Umv. of Wtsconsm, Madison, Wis., August 1979.
	11	BUZEN, J P, AND RUBm, D.B.Effects of compacuon on memory uUl/zation in mulUprogramming systems Proc. Int. IRIA Workshop on Modeling and Evaluation of Computer Archtteetutes and Networks, Rocquencourt, France, 1974, pp. 113-124.
	12	COFI~MAN, E.G. JR, AND DENNING, P.I. Operaung Systems Theory. Prentice-Hall, Englewood Chffs, N.J., 1973, p. 172
	13	COURTOlS, P.J. Oecomposabihty: Queueing and Computer System Applications. Academic Press, New York, ! 977.
	14	GELI~NBE, E., AND KLmrNCKX, A.Random taj ection control of muldprogramming in virtual memory. IEEE Trans. Sofiw. Eng. SE4, 1 (Jan. 1978), 2-17.
	15	Alan G. Konheim , Martin Reiser, A Queueing Model with Finite Waiting Room and Blocking, Journal of the ACM (JACM), v.23 n.2, p.328-341, April 1976 [doi>10.1145/321941.321952]
	16	KONSr.tM, A.G., AND Rr.ISER, M. Finite capacity queuemg systems. SlAM ~ Comput. 7, 2 (May 1978), 210-229
	17	LITTLE, J.D.C.A proof for the queuemg formula L = AW. Oper. Res. 9, 3 (May 1961), 383--387.
	18	MARATHE, V P. Priority queueing systems with simultaneous server requirements. Ph.D. Dissertation, Cornell Umv., Ithaca, N Y., May 1972
	19	MUNTZ, R R Analytic modeling of interactive systems. Proc. IEEE 63, 6 (June 1975), 946-953.
	20	Om~,tmlq, K.J.Analytic models of multiple resource systems. Ph.D. Dissertation, Univ. of Chicago, Ctucago, Ill, June 1973
	21	Kenneth J. Omahen, Capacity Bounds for Multiresource Queues, Journal of the ACM (JACM), v.24 n.4, p.646-663, Oct. 1977 [doi>10.1145/322033.322043]
	22	OMAHEN, K., AND MARATHE, V.A queuemg model for a muluprocessor system with partiuoned memory. Tech. Rep. 132, Computer Soenee Dep., Purdue Univ, Lafayette, Ind., Jan. 1975.
	23	REVESZ, PThe Laws of Large Numbers. Academic Press, New York, 1968, p. 130.
	24	Ross, S.M. Applied Probabdity Models with Optimization Applicatwns. Holden-Day, San Francisco, 1970, pp, 31--60.

CITED BY 6

	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
	Edward D. Lazowska , John Zahorjan, Multiple class memory constrained queueing networks, ACM SIGMETRICS Performance Evaluation Review, v.11 n.4, December 1982
	Alexandre Brandwajn, Fast approximate solution of multiprogramming models, ACM SIGMETRICS Performance Evaluation Review, v.11 n.4, December 1982
	Carlos Gonzalez , Kian Tavakoli, A model for an adaptive scheduler, Proceedings of the 1988 ACM sixteenth annual conference on Computer science, p.424-428, February 1988, Atlanta, Georgia, United States
	Dimitrios Filippopoulos , Helen Karatza, A two-class parallel queue with pure space sharing among rigid jobs and general service times, Proceedings of the 1st international conference on Performance evaluation methodolgies and tools, October 11-13, 2006, Pisa, Italy
	D. Filippopoulos , H. Karatza, A two-class parallel system with general service times of the parallel class, Journal of Computer and System Sciences, v.74 n.6, p.942-964, September, 2008