Memory Requirements in a Multiprocessing Environment

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Memory Requirements in a Multiprocessing Environment

Full text

Pdf (702 KB)

Source

Journal of the ACM (JACM) archive
Volume 19 , Issue 1 (January 1972) table of contents

Pages: 57 - 69

Year of Publication: 1972

ISSN:0004-5411

Authors

Y. E. Chen	The University of Iowa, Iowa City, Iowa and Purdue University, Lafayette, Indiana
D. L. Epley	University of Iowa, Iowa City, Iowa

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 18, Citation Count: 2

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/321679.321685 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	RICHARDS, P. Parallel programming. Rep. No. T0-B60-27, Technical Operations, Inc., Burlington, Mass. (Aug. 1960).
	2	GRAHAM, R.L. Bounds for certain multiprocessing anomalies. Bell System Tech. J. 46 (Nov. 1966), 1563-1581.
	3	G. K. Manacher, Production and Stabilization of Real-Time Task Schedules, Journal of the ACM (JACM), v.14 n.3, p.439-465, July 1967 [doi>10.1145/321406.321408]
	4	GR.~HAM, H.L. Bounds on mu}tiprocessing timing anomalies. SIAM J. Appl. Math. I7, 2 (Mar. 1969), 416-429.
	5	J. Heller, Sequencing Aspects of Multiprogramming, Journal of the ACM (JACM), v.8 n.3, p.426-439, July 1961 [doi>10.1145/321075.321086]
	6	Cn~x, Y. E. Schedules and memory requirements of computation graphs and multiprocessor systems. Ph.D. Diss., Dept. of Elec. Eng., U. of Iowa, Iowa City, Iowa (Feb. 1969).
	7	FUJII, ~., I(ASAMI, T., AND NINOMIYA, K. Optimal sequencing of two equivalent processors. SL4M J. Appl. Math. 17, 4 (,July 1969), 784-789.
	8	~IuNTZ, R. }~., AND COFFMAN, E. G. Optimal preemptive scheduling on two-processor syslems, IEEE Trans. C-18, 11 (Nov. 1969), 1014-1020.
	9	CONWAY, ~. W., ~IAXWELL, W. L., AND ~'~ILLER, L.W. Theory of Scheduling. Addison- Wesley, l{eading, Mass., 1967.
	10	CHEN, Y. E., AND EPLEY, D. L. Bounds on memory requirements of multiprocessor systems. Proc. of Sixth Annual Allerlon Conf.; University of Illinois, Urbana, Illinois, October 1968, pp. 523-531.

CITED BY 2

	J. L. Baer, A Survey of Some Theoretical Aspects of Multiprocessing, ACM Computing Surveys (CSUR), v.5 n.1, p.31-80, March 1973
	K. L. Krause , V. Y. Shen , H. D. Schwetman, A task-scheduling algorithm for a multiprogramming computer system, ACM SIGOPS Operating Systems Review, v.7 n.4, p.112-118, October 1973