Compile-time generation of regular communications patterns

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Compile-time generation of regular communications patterns

Full text

Pdf (844 KB)

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: 101 - 110

Year of Publication: 1991

ISBN:0-89791-459-7

Author

Charles Koelbel

Center for Research on Parallel Computation, Rice University, Houston, TX

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): 1, Downloads (12 Months): 9, Citation Count: 16

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.125890 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	Françoise André , Jean-Louis Pazat , Henry Thomas, Pandore: a system to manage data distribution, Proceedings of the 4th international conference on Supercomputing, p.380-388, June 11-15, 1990, Amsterdam, The Netherlands
	2	V. Balasundaram, G. Fox, K. Kennedy, and U. Kremer. An interactive environment for data partitioning and distribution. In Proceedzngs of the 5th Distributed Memory Computing Conference, Charleston, SC, April 1990.
	3	D. Callahan and K. Kennedy. Compiling programs for distributed-memory multiprocessors. Journal of Supercomputing, 2:151-169, October 1988.
	4	A. Cheung and A. Reeves. The Paragon multicomputer environment: A first implementation. Technical Report EE-CEG-89-9~ Cornell University Computer Engineering Group, Ithaca, NY, July 1989.
	5	G. Fox, S. Hiranandani, K. Kennedy, C. Koelbel, U. Kremer, C. Tseng, and M. Wu. Fortran D language specification. Technical Report TR90-141, Dept. of Computer Science, Rice University, December 1990.
	6	M. Gem&.Automatic Parallelization for Distribute&Memory Multiprocessing Systems. PhD thesis, University of Bonn, December 1989.
	7	Charles Howard Koelbel, Compiling programs for nonshared memory machines, Purdue University, West Lafayette, IN, 1991
	8	C. Koelbel , P. Mehrotra , J. Van Rosendale, Supporting shared data structures on distributed memory architectures, Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming, p.177-186, March 14-16, 1990, Seattle, Washington, United States
	9	Jingke Li , Marina Chen, Generating explicit communication from shared-memory program references, Proceedings of the 1990 conference on Supercomputing, p.865-876, October 1990, New York, New York, United States
	10	Michael J. Quinn , Philip J. Hatcher, Data-Parallel Programming on Multicomputers, IEEE Software, v.7 n.5, p.69-76, September 1990 [doi>10.1109/52.57894]
	11	A. Rogers , K. Pingali, Process decomposition through locality of reference, Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation, p.69-80, June 19-23, 1989, Portland, Oregon, United States
	12	M. Rosing, lZ. Schnabel, and R. Weaver. Expressing complex parallel algorithms in DINO. In Proceedings of the ~th Conference on Hypercube Concurrent Computers and Applicatzons, Monterey, CA, March 1989.
	13	P. S. Tseng. A parallelizing compiler for distributed memory parallel computers. In Proceedings of the SIGPLAN '90 Conference on Program Language Design and Implementatzon, White Plains, NY, June 1990.
	14	H. Zima, H.-J. Bast, and M. Gerndt. SUPERB: A tool for semi-automatic MIMD/SIMD parallelization. Parallel Computing, 6:1-18, 1988.

CITED BY 16

	Tsung-Chuan Huang , Liang-Cheng Shiu , Yi-Jay Lin, Generating efficient local memory access sequences for coupled subscripts in data-parallel programs, Information Sciences—Informatics and Computer Science: An International Journal, v.149 n.4, p.249-261, February 2003
	Lei Wang , James M. Stichnoth , Siddhartha Chatterjee, Runtime performance of parallel array assignment: an empirical study, Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM), p.4-es, January 01-01, 1996, Pittsburgh, Pennsylvania, United States
	Saman P. Amarasinghe , Monica S. Lam, Communication optimization and code generation for distributed memory machines, ACM SIGPLAN Notices, v.28 n.6, p.126-138, June 1993
	S. D. Kaushik , C.-H. Huang , R. W. Johnson , P. Sadayappan, An approach to communication-efficient data redistribution, Proceedings of the 8th international conference on Supercomputing, p.364-373, July 11-15, 1994, Manchester, England
	Siddhartha Chatterjee , John R. Gilbert , Fred J. E. Long , Robert Schreiber , Shang-Hua Teng, Generating local addresses and communication sets for data-parallel programs, ACM SIGPLAN Notices, v.28 n.7, p.149-158, July 1993
	Gwan-Hwan Hwang , Cheng-Wei Chen , Jenq Kuen Lee , Roy Dz-Ching Ju, Segmented Alignment: An Enhanced Model to Align Data Parallel Programs of HPF, The Journal of Supercomputing, v.25 n.1, p.17-41, May 2003
	Seema Hiranandani , Ken Kennedy , John Mellor-Crummey , Ajay Sethi, Compilation techniques for block-cyclic distributions, Proceedings of the 8th international conference on Supercomputing, p.392-403, July 11-15, 1994, Manchester, England
	PeiZong Lee , Wen-Yao Chen, Generating communication sets of array assignment statements for block-cyclic distribution on distributed memory parallel computers, Parallel Computing, v.28 n.9, p.1329-1368, September 2002
	Ernesto Su , Daniel J. Palermo , Prithviraj Banerjee, Processor Tagged Descriptors: A Data Structure for Compiling for Distributed-Memory Multicomputers, Proceedings of the IFIP WG10.3 Working Conference on Parallel Architectures and Compilation Techniques, p.123-132, August 24-26, 1994
	Gagan Agrawal , Alan Sussman , Joel Saltz, An Integrated Runtime and Compile-Time Approach for Parallelizing Structured and Block Structured Applications, IEEE Transactions on Parallel and Distributed Systems, v.6 n.7, p.747-754, July 1995
	Gwan-Hwan Hwang, An efficient algorithm for communication set generation of data parallel programs with block-cyclic distribution, Parallel Computing, v.30 n.4, p.473-501, April 2004
	Kees van Reeuwijk , Will Denissen , Henk J. Sips , Edwin M. R. M. Paalvast, An Implementation Framework for HPF Distributed Arrays on Message-Passing Parallel Computer Systems, IEEE Transactions on Parallel and Distributed Systems, v.7 n.9, p.897-914, September 1996
	Ching-Hsien Hsu , Sheng-Wen Bai , Yeh-Ching Chung , Chu-Sing Yang, A Generalized Basic-Cycle Calculation Method for Efficient Array Redistribution, IEEE Transactions on Parallel and Distributed Systems, v.11 n.12, p.1201-1216, December 2000
	Kuei-Ping Shih , Jang-Ping Sheu , Chih-Yung Chang, Efficient Address Generation for Affine Subscripts in Data-Parallel Programs, The Journal of Supercomputing, v.17 n.2, p.205-227, Sept. 2000
	Yeh-Ching Chung , Ching-Hsien Hsu , Sheng-Wen Bai, A Basic-Cycle Calculation Technique for Efficient Dynamic Data Redistribution, IEEE Transactions on Parallel and Distributed Systems, v.9 n.4, p.359-377, April 1998
	Rajeev Thakur , Alok Choudhary , J. Ramanujam, Efficient Algorithms for Array Redistribution, IEEE Transactions on Parallel and Distributed Systems, v.7 n.6, p.587-594, June 1996