Problem and machine sensitive communication optimization

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Problem and machine sensitive communication optimization

Full text

Pdf (1.21 MB)

Source

International Conference on Supercomputing archive
Proceedings of the 12th international conference on Supercomputing table of contents

Melbourne, Australia

Pages: 117 - 124

Year of Publication: 1998

ISBN:0-89791-998-X

Authors

Thomas Fahringer	Institute for Software Technology and Parallel Systems, University of Vienna, Liechtensteinstr. 22, A-1090, Vienna, Austria
Eduard Mehofer	Institute for Software Technology and Parallel Systems, University of Vienna, Liechtensteinstr. 22, A-1090, Vienna, Austria

Sponsors

SIGARCH: ACM Special Interest Group on Computer Architecture
IEEE-CS : Computer Society

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 21, 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/277830.277856 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	Saman P. Amarasinghe , Monica S. Lam, Communication optimization and code generation for distributed memory machines, Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation, p.126-138, June 21-25, 1993, Albuquerque, New Mexico, United States
	2	S. Benkner et al. Vienna Fortran Compilation System - Version 2.0- User's Guide, October 1995.
	3	Soumen Chakrabarti , Manish Gupta , Jong-Deok Choi, Global communication analysis and optimization, Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation, p.68-78, May 21-24, 1996, Philadelphia, Pennsylvania, United States
	4	Thomas Fahringer, Automatic Performance Prediction of Parallel Programs, Kluwer Academic Publishers, Norwell, MA, 1996
	5	Thomas Fahringer, Efficient Symbolic Analysis for Parallelizing Compilers and Performance Estimators, The Journal of Supercomputing, v.12 n.3, p.227-252, May 1, 1998 [doi>10.1023/A:1008013906463]
	6	Thomas Fahringer , Matthew Haines , Piyush Mehrotra, On the utility of threads for data parallel programming, Proceedings of the 9th international conference on Supercomputing, p.51-59, July 03-07, 1995, Barcelona, Spain [doi>10.1145/224538.224544]
	7	Thomas Fahringer , Eduard Mehofer, Buffer-Safe Communication Optimization based on Data Flow Analysis and Performance Prediction, Proceedings of the 1997 International Conference on Parallel Architectures and Compilation Techniques, p.189, November 11-15, 1997
	8	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 [doi>10.1109/71.508249]
	9	Reinhard von Hanxleden , Ken Kennedy, GIVE-N-TAKE—a balanced code placement framework, Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation, p.107-120, June 20-24, 1994, Orlando, Florida, United States
	10	Ken Kennedy , Ajay Sethi, Resource-Based Communication Placement Analysis, Proceedings of the 9th International Workshop on Languages and Compilers for Parallel Computing, p.369-388, August 08-10, 1996
	11	Chau-Wen Tseng, Compiler optimizations for eliminating barrier synchronization, Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming, p.144-155, July 19-21, 1995, Santa Barbara, California, United States