A Study of Schedules as Models of Synchronous Parallel Computation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A Study of Schedules as Models of Synchronous Parallel Computation

Full text

Pdf (1.37 MB)

Source

Journal of the ACM (JACM) archive
Volume 24 , Issue 4 (October 1977) table of contents

Pages: 544 - 565

Year of Publication: 1977

ISSN:0004-5411

Authors

R. A. DeMillo	School of Information and Computer Science, Georgia Institute of Technology, Atlanta, GA
K. Vairavan	Electrical Engineering Department, University of Wisconsin-Milwaukee, P O Box 413, Milwaukee, WI
E. Sycara-Cyranski	Center for Planning and Economic Research, 22 Hippohratas St, Athens, Greece

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

references 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/322033.322035 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	J. L. Baer, A Survey of Some Theoretical Aspects of Multiprocessing, ACM Computing Surveys (CSUR), v.5 n.1, p.31-80, March 1973 [doi>10.1145/356612.356615]
	2	BERNSTEUN, A J. Analysis of programs for parallel processing IEEE Trans Comptrs C-15, 5 (Oct 1966), 757-763
	3	Janusz A. Brzozowski, Derivatives of Regular Expressions, Journal of the ACM (JACM), v.11 n.4, p.481-494, Oct. 1964 [doi>10.1145/321239.321249]
	4	Edward G. Coffman, Jr. , Peter J. Denning, Operating Systems Theory, Prentice Hall Professional Technical Reference, 1973
	5	DEfiNING, P.J On the determinacy of schemata Project MAC Conf. on Concurrent Syst and Parallel Comput., 1970, pp 143-148.
	6	John E. Hopcroft , Jeffrey D. Ullman, Formal languages and their relation to automata, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1969
	7	KARP, R.M., ArCD MILLER, R E. Parallel program schemata J. Comptr. Syst Sct 3, 2 (May 1969), 147- 195.
	8	Robert M. Keller, Parallel Program Schemata and Maximal Parallelism II: Construction of Closures, Journal of the ACM (JACM), v.20 n.4, p.696-710, Oct. 1973 [doi>10.1145/321784.321795]
	9	KLEE~F, S C Representation of events m nerve nets and finite automata In Automata Studies, C.E Shannon and J McCartny, Eds., Prmceton U. Press, Priaceton, N.J., 1956, pp 3-43
	10	KUCK, D J. Multloperatnon machine computational complexity in Complexuty of Sequentnai and Parallel Numerical Algorithms, J F Traub, Ed., Academic Press, New York, 1973, pp. 17-48
	11	LUCXnAM, D C, PARK, D.M.R, Arid P^TERSON, M.S On formalized computer programs J Comptr Syst. Sc~. 4, 2 (May 1970), 220-249
	12	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]
	13	Jonathan K. Millen, Construction with parallel derivatives of the closure of a parallel program schema, Proceedings of the sixth annual ACM symposium on Theory of computing, p.242-247, April 30-May 02, 1974, Seattle, Washington, United States [doi>10.1145/800119.803901]
	14	MILLER, R.E. A comparison of some theoretical models of computat,ons IEEE Trans Comptrs C-22, 5 (May 1973), 710-717
	15	RAMAMOORTHY, C.V , CHANDY, K.M, AND GONZALEZ, M.J Optimal scheduhng strategies m a multiprocessor system. IEEE Trans Comptrs C-21,2 (Feb. 1972), 137-146
	16	RAMAMOORTm', C V, AND GONZALEZ, i J. A survey of techniques for recogmzmg parallel processable streams m computer programs. Proc AFIPS 1969 FJCC, Vol. 35, AFIPS Press, Montvale, N J., pp 1- 15
	17	Raymond Reiter, Scheduling Parallel Computations, Journal of the ACM (JACM), v.15 n.4, p.590-599, Oct. 1968 [doi>10.1145/321479.321485]
	18	SLOTZ, D R. The flow graph schemata model of parallel computation. Ph D Th, M I T, Cambridge,{ Mass., 1968
	19	J. D. Ullman, Polynomial complete scheduling problems, Proceedings of the fourth ACM symposium on Operating system principles, p.96-101, January 1973
	20	VAIRAVAN, K., ,,,I~O DEMILLO, R.A On the computational complexity of a generalized scheduling problem IEEE Trans. Comptrs C-25, 1 (Nov 1976), 1067-1073