Renamings and Economy of Memory in Program Schemata

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Renamings and Economy of Memory in Program Schemata

Full text

Pdf (767 KB)

Source

Journal of the ACM (JACM) archive
Volume 25 , Issue 1 (January 1978) table of contents

Pages: 10 - 22

Year of Publication: 1978

ISSN:0004-5411

Author

Luigi Logrippo

Department of Computer Science, University of Ottawa, Ottawa, Ontario, Canada K1N 6N5

Publisher

ACM New York, NY, USA

Bibliometrics

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

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/322047.322049 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	Alfred V. Aho , John E. Hopcroft, The Design and Analysis of Computer Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1974
	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 [doi>10.1145/356612.356615]
	3	CHANDRA, A I~ On the properties and apphcatlons of program schemas Memo AIM-188, A I Lab , Stanford U , Stanford, Cahf, 1973
	4	David Gries, Compiler Construction for Digital Computers, John Wiley & Sons, Inc., New York, NY, 1971
	5	Ia'ICIN, V.E Logic-term eqmvalence of program schemata Cybernettcs 8 (1972), 5-28
	6	K^RP, R.M , AND MILLER, R E Parallel program schemata J Comptr and Syst Sci 3 (1969), 147- 195
	7	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]
	8	KOTOV, V.E, AND NARIN'YANI, A S Theory of parallel programming, Pts I and II Cybernettcs 10 (1974), 1-18,377-392,735-748
	9	LAVROV. S.S Economy of memory m closed operator schemes U.S.S.R Computat Math. and Math Physics I (1961), 810-828.
	10	Lo6RtPPO, L Renamings m parallel program schemas Res. Rep. CS-74-05, Dept. Appl Analysis and Comptr. Set., U. of Waterloo, Waterloo, Ont., Canada, 1974.
	11	Looau,po, L Renamings and memory economy in program schemas. Res. Rep. TR 76-01, Dept. Comptr. Set., U. of Ottawa, Ottawa, Ont, Canada, Nov 1976.
	12	M^RTINYUg, V.V On the economtcal dtstributlon of a store. U.S S.R. Computat. Math and Math. Phystcs 2 (1962), 469-481.
	13	PATgttSOlq, M.S Eqmvalence problems m a model of computation Tech Memo No I, A { Lab., M I.T, Cambridge, Mass, 1970
	14	Saul Aaron Volansky, Graph model analysis and implementation of computational sequences, 1970
	15	WEmRAUCH, K The computational complexity of program schemata. J Comptr and Syst. Sc~. 12 (1976), 80-107
	16	YERS~OV, A P Reduction of the problem of memory alloeatton m programming to the problem of coloring the verttces of a graph Sovtet Math 3 (1962), 163-165
	17	YERSUOV, A P , ED The Alpha Automauc Programming System Academic Press, London, 1971

CITED BY 3

	Luigi Logrippo, Renamings, Maximal Parallelism, and Space-Time Tradeoff in Program Schemata, Journal of the ACM (JACM), v.26 n.4, p.819-833, Oct. 1979
	Janet Fabri, Automatic storage optimization, ACM SIGPLAN Notices, v.14 n.8, p.83-91, August 1979
	Frances E. Allen , Janet Fabri, Automatic storage optimization, ACM SIGPLAN Notices, v.39 n.4, April 2004