Detecting static algorithms by partial evaluation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Detecting static algorithms by partial evaluation

Full text

Pdf (1.28 MB)

Source

ACM/SIGPLAN Workshop Partial Evaluation and Semantics-Based Program Manipulation archive
Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation table of contents

New Haven, Connecticut, United States

Pages: 31 - 42

Year of Publication: 1991

ISBN:0-89791-433-3

Also published in ...

Author

Björn Lisper

Dept. of Telecommunication and Computer Systems, The Royal Institute of Technology, S-100 44 Stockholm, Sweden

Sponsor

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

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

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/115865.115870 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 , Ravi Sethi , Jeffrey D. Ullman, Compilers: principles, techniques, and tools, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
	2	Vincenzo Ambriola , Fosca Giannotti , Dino Pedreschi , Franco Turini, Symbolic semantics and program reduction, IEEE Transactions on Software Engineering, v.11 n.8, p.784-794, Aug. 1985 [doi>10.1109/TSE.1985.232527]
	3	J. Arsac , Y. Kodratoff, Some Techniques for Recursion Removal from Recursive Functions, ACM Transactions on Programming Languages and Systems (TOPLAS), v.4 n.2, p.295-322, April 1982 [doi>10.1145/357162.357171]
	4	Andrew Berlin , Daniel Weise, Compiling Scientific Code Using Partial Evaluation, Computer, v.23 n.12, p.25-37, December 1990 [doi>10.1109/2.62091]
	5	R. M. Burstall , John Darlington, A Transformation System for Developing Recursive Programs, Journal of the ACM (JACM), v.24 n.1, p.44-67, Jan. 1977 [doi>10.1145/321992.321996]
	6	Marina C. Chen, A design methodology for synthesizing parallel algorithms and architectures, Journal of Parallel and Distributed Computing, v.3 n.4, p.461-491, December 1, 1986 [doi>10.1016/0743-7315(86)90010-9]
	7	Marina C. Chen, A parallel language and its compilation to multiprocessor machines or VLSI, Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.131-139, January 01, 1986, St. Petersburg Beach, Florida [doi>10.1145/512644.512656]
	8	J. Darlington and R. M. Burstall. A system which automatically improves programs. Acta inform., 6(1):41-60, 1976.
	9	J.-M. Delosme and I. Ipsen. Efficient systolic arrays for the solution of Toeplitz systems: an illustration of a methodology for the construction of systolic architectures in VLSI. In W. Moore, A. McCabe, and R. Urquhart, editors, Systolic Arrays, pages 37-46, Bristol, UK, 1987. Adam Hilger.
	10	Michael J.C. Gordon, Programming language theory and its implementation, Prentice Hall International (UK) Ltd., Hertfordshire, UK, 1988
	11	G. Gr~tzer. Universal Algebra. Springer-Verlag, New York, NY, 1979.
	12	J. Roger Hindley , Jonathan P. Seldin, Introduction to combinators and &lgr;-calculus, Cambridge University Press, New York, NY, 1986
	13	Chua-Huang Huang , Christian Lengauer, The derivation of systolic implementations, Acta Informatica, v.24 n.6, p.595-632, November 1, 1987
	14	G. Huet and B. Lang. Proving and applying program transformations expressed with second-order patterns. Acta Inform., 11(1):31-55, Jan. 1978.
	15	Richard M. Karp , Raymond E. Miller , Shmuel Winograd, The Organization of Computations for Uniform Recurrence Equations, Journal of the ACM (JACM), v.14 n.3, p.563-590, July 1967 [doi>10.1145/321406.321418]
	16	Boontee Kruatrachue , Ted Lewis, Grain Size Determination for Parallel Processing, IEEE Software, v.5 n.1, p.23-32, January 1988 [doi>10.1109/52.1991]
	17	H. T. Kung. Why systolic architectures? Compuler, 15:37-46, Jan. 1982.
	18	S. Y. Kung, VLSI array processors, Prentice-Hall, Inc., Upper Saddle River, NJ, 1987
	19	P. Kursawe. Pure partial evaluation and instantiation. In D. Bjcrner, A. P. Ershov, and N. D. Jones, editors, Partial Evaluation and Mixed Computation, pages 283-298, Amsterdam, 1988. IFIP, North-Holland.
	20	Björn Lisper, Synthesizing synchronous systems by static scheduling in space-time, Springer-Verlag New York, Inc., New York, NY, 1989
	21	B. Lisper. The Interactive Space-time Scheduler. Microprocessing and Microprogramming, 30(1-5):109-116, Aug. 1990.
	22	Björn Lisper, Synthesis of time-optimal systolic arrays with cells with inner structure, Journal of Parallel and Distributed Computing, v.10 n.2, p.182-187, Oct. 1990 [doi>10.1016/0743-7315(90)90027-M]
	23	Zohar Manna, Introduction to Mathematical Theory of Computation, McGraw-Hill, Inc., New York, NY, 1974
	24	Carolyn McCreary , Helen Gill, Automatic determination of grain size for efficient parallel processing, Communications of the ACM, v.32 n.9, p.1073-1078, Sept. 1989 [doi>10.1145/66451.66454]
	25	J. R. McGraw, S. Skedzielewski, S. Allan, R. Oldehoeft, J. Glauert, C. Kirkham, B. Noyce, and R. Thomas. SISAL" Streams and iterations in a single assignment language, language reference manual version 1.2. Technical Report M-146, Lawrence Livermore National Laboratory, University of California at Davis, Mar. 1985.
	26	D. I. Moldovan. On the analysis and synthesis of VLSI algorithms. IEEE Trans. Comput., C- 31:1121-1126, Oct. 1982.
	27	David A. Padua , Michael J. Wolfe, Advanced compiler optimizations for supercomputers, Communications of the ACM, v.29 n.12, p.1184-1201, Dec. 1986 [doi>10.1145/7902.7904]
	28	A. Pettorossi. Methodologies for Transformation and Memoing in Applicative Languages. PhD thesis, Dept. Comput. Sci., University of Edinburgh, Oct. 1984.
	29	Patrice Quinton, Automatic synthesis of systolic arrays from uniform recurrent equations, Proceedings of the 11th annual international symposium on Computer architecture, p.208-214, January 1984
	30	S. V. Rajopadye and R. M. Fujimoto. Synthesizing systolic arrays from recurrence equations. Parallel Compuling, 14:163-189, 1990.
	31	S. K. Rao and T. Kailath. Regular iterative algorithms and their implementation on processor arrays. Proc. IEEE, 76(3):259-269, Mar. 1988.
	32	P. Sestoft. Automatic call unfolding in a partial evaluator. In D. Bjcrner, A. P. Ershov, and N. D. Jones, editors, Parlial Evaluation and Mixed Computalion, pages 485-506, Amsterdam, 1988. IFIP, North-Holland.
	33	W. Shang and J. A. B. Fortes. On the optimality of linear schedules. J. VLSI Signal Processing, 1:209- 220, 1989.