Detecting redundant accesses to array data

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Detecting redundant accesses to array data

Full text

Pdf (1.05 MB)

Source

Conference on High Performance Networking and Computing archive
Proceedings of the 1991 ACM/IEEE conference on Supercomputing table of contents

Albuquerque, New Mexico, United States

Pages: 854 - 865

Year of Publication: 1991

ISBN:0-89791-459-7

Authors

Elana D. Granston	Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign, Urbana, Illinois
Alexander V. Veidenbaum	Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign, Urbana, Illinois

Sponsors

IEEE : Institute of Electrical and Electronics Engineers
SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	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/125826.126714 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	Vasanth Balasundaram, A mechanism for keeping useful internal information in parallel programming tools: the data access descriptor, Journal of Parallel and Distributed Computing, v.9 n.2, p.154-170, June 1990 [doi>10.1016/0743-7315(90)90043-O]
	3	Chi-Hung Chi and Hank Dietz. Improving Cache Performance by Selective Cache Bypass. Technical Report TR-EE 88-36, School of Electrical Engineering, Purdue University, July 1988.
	4	Christine Eisenbeis, William J alby, Daniel Windheiser, and Francois Bodin. A Strategy for Array Management in Local Memory. In Workshop on Parallel on Programming Languages and Compilers for Parallel Programming~ 1990.
	5	K. Gallivan , W. Jalby , D. Gannon, On the problem of optimizing data transfers for complex memory systems, Proceedings of the 2nd international conference on Supercomputing, p.238-253, June 1988, St. Malo, France [doi>10.1145/55364.55388]
	6	Elana D. Granston and Alexander V. Veidenbaum. An Integrated Hardware/Software Solution for Effective Management of Local Storage in ttigh-Performanee Systems. In International Conference on Parallel Processing, August 1991.
	7	Elana D. Granston and Alexander V. Veidenbantu. Detecting Redundant Accesses to Array Data. Technical Report 1053, Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign, 1991.
	8	T. Gross , P. Steenkiste, Structured dataflow analysis for arrays and its use in an optimizing complier, Software—Practice & Experience, v.20 n.2, p.133-155, February 1990 [doi>10.1002/spe.4380200203]
	9	Paul Havlak , Ken Kennedy, Experience with interprocedural analysis of array side effects, Proceedings of the 1990 conference on Supercomputing, p.952-961, October 1990, New York, New York, United States
	10	E. Morel , C. Renvoise, Global optimization by suppression of partial redundancies, Communications of the ACM, v.22 n.2, p.96-103, Feb. 1979 [doi>10.1145/359060.359069]
	11	B. K. Rosen , M. N. Wegman , F. K. Zadeck, Global value numbers and redundant computations, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.12-27, January 10-13, 1988, San Diego, California, United States [doi>10.1145/73560.73562]
	12	Carl M. Rosene , Ken W. Kennedy, Incremental dependence analysis, 1990
	13	Dale Schouten. An Overview of Interprocedural Analysis Techniques for High Performance Parallelizing Compilers. Master's thesis, Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign, December 1989.
	14	Michael E. Wolf , Monica S. Lam, A data locality optimizing algorithm, ACM SIGPLAN Notices, v.26 n.6, p.30-44, June 1991

CITED BY 15

	Sungdo Moon , Mary W. Hall, Evaluation of predicated array data-flow analysis for automatic parallelization, ACM SIGPLAN Notices, v.34 n.8, p.84-95, Aug. 1999
	Yong-Fong Lee , Barbara G. Ryder, A comprehensive approach to parallel data flow analysis, Proceedings of the 6th international conference on Supercomputing, p.236-247, July 19-24, 1992, Washington, D. C., United States
	M. Kandemir , P. Banerjee , A. Choudhary , J. Ramanujam , N. Shenoy, A global communication optimization technique based on data-flow analysis and linear algebra, ACM Transactions on Programming Languages and Systems (TOPLAS), v.21 n.6, p.1251-1297, Nov. 1999
	Junjie Gu , Zhiyuan Li , Gyungho Lee, Symbolic array dataflow analysis for array privatization and program parallelization, Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM), p.47-es, December 04-08, 1995, San Diego, California, United States
	Reinhard von Hanxleden , Ken Kennedy, A balanced code placement framework, ACM Transactions on Programming Languages and Systems (TOPLAS), v.22 n.5, p.816-860, Sept. 2000
	Evelyn Duesterwald , Rajiv Gupta , Mary Lou Soffa, A practical data flow framework for array reference analysis and its use in optimizations, ACM SIGPLAN Notices, v.28 n.6, p.68-77, June 1993
	István Forgács, An exact array reference analysis for data flow testing, Proceedings of the 18th international conference on Software engineering, p.565-574, March 25-29, 1996, Berlin, Germany
	Hui Li , Kenneth C. Sevcik, Exploiting cache affinity in software cache coherence, Proceedings of the 8th international conference on Supercomputing, p.264-273, July 11-15, 1994, Manchester, England
	Dror E. Maydan , Saman P. Amarasinghe , Monica S. Lam, Array-data flow analysis and its use in array privatization, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.2-15, March 1993, Charleston, South Carolina, United States
	Reinhard von Hanxleden , Ken Kennedy, GIVE-N-TAKE—a balanced code placement framework, ACM SIGPLAN Notices, v.29 n.6, p.107-120, June 1994
	Soumen Chakrabarti , Manish Gupta , Jong-Deok Choi, Global communication analysis and optimization, ACM SIGPLAN Notices, v.31 n.5, p.68-78, May 1996
	Lynn Choi , Pen-Chung Yew, Compiler Analysis for Cache Coherence: Interprocedural Array Data-Flow Analysis and Its Impact on Cache Performance, IEEE Transactions on Parallel and Distributed Systems, v.11 n.9, p.879-896, September 2000
	Mahmut Kandemir , Alok Choudhary , Prithviraj Banerjee , J. Ramanujam , Nagaraj Shenoy, Minimizing Data and Synchronization Costs in One-Way Communication, IEEE Transactions on Parallel and Distributed Systems, v.11 n.12, p.1232-1251, December 2000
	Mary W. Hall , Saman P. Amarasinghe , Brian R. Murphy , Shih-Wei Liao , Monica S. Lam, Interprocedural parallelization analysis in SUIF, ACM Transactions on Programming Languages and Systems (TOPLAS), v.27 n.4, p.662-731, July 2005
	Manish Gupta , Edith Schonberg , Harini Srinivasan, A Unified Framework for Optimizing Communication in Data-Parallel Programs, IEEE Transactions on Parallel and Distributed Systems, v.7 n.7, p.689-704, July 1996