Data-localization for Fortran macro-dataflow computation using partial static task assignment

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Data-localization for Fortran macro-dataflow computation using partial static task assignment

Full text

Pdf (850 KB)

Source

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

Philadelphia, Pennsylvania, United States

Pages: 61 - 68

Year of Publication: 1996

ISBN:0-89791-803-7

Authors

Akimasa Yoshida	Department of Electrical, Electronics and Computer Engineering, Waseda University, 3-4-1 Ohkubo Shinjuku-ku, Tokyo 169, Japan
Kenichi Koshizuka	Department of Electrical, Electronics and Computer Engineering, Waseda University, 3-4-1 Ohkubo Shinjuku-ku, Tokyo 169, Japan
Hironori Kasahara	Department of Electrical, Electronics and Computer Engineering, Waseda University, 3-4-1 Ohkubo Shinjuku-ku, Tokyo 169, Japan

Sponsor

SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 23, 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/237578.237586 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	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]
	2	Michael Joseph Wolfe, Optimizing Supercompilers for Supercomputers, MIT Press, Cambridge, MA, 1990
	3	U. Banerjee, R. Eigenmann, A. Nicolau, and D.A. Padua. Automatic program parallelization. Pro~. o/ IEEE, 81(2):211-243, Feb. 1993.
	4	D.A. Padua, D.J. Kuck, and D.H. Lawrie. Highspeed multiprocessor and compilation techniques, iEEE Trans. Comput., C-29(9):763-776, 1980.
	5	Michael Joseph Wolfe , Carter Shanklin , Leda Ortega, High Performance Compilers for Parallel Computing, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1995
	6	Utpal K. Banerjee, Dependence Analysis for Supercomputing, Kluwer Academic Publishers, Norwell, MA, 1988
	7	Utpal K. Banerjee, Loop Parallelization, Kluwer Academic Publishers, Norwell, MA, 1994
	8	Hironori Kasahara , Hiroki Honda , Seinosuke Narita, Parallel processing of near fine grain tasks using static scheduling OSCAR (optimally scheduled advanced multiprocessor), Proceedings of the 1990 conference on Supercomputing, p.856-864, October 1990, New York, New York, United States
	9	Alfred V. Aho , Ravi Sethi , Jeffrey D. Ullman, Compilers: principles, techniques, and tools, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
	10	H. Honda, M. Iwata, and H. Kasahaxa. Coarse grain parallelism detection scheme of Fortran pror~ms. Trans. IEICE(in Japanese), Jn-D-I(12):951- 60, 1990.
	11	D. Gajski, D. Kuck, D. Lawrie, and A. Sameh. Cedar. Report UIUCDCS-R-83-1123, Dept. of Computer Sci., Univ. Illinois at Urbana. Champa,gn, Feb. 1983.
	12	D.D. Gajski, D.J. Kuck, and D.A. Padua. Dependence driven computation. Proc. of COMPCON 81 Sprint Computer Conf., pages 168-172, 1981.
	13	H. Kasahara, H. Honda, M. Iwata, and M. Hirota. A compilation scheme for macro-datafiow computation on hierarchical multiprocessor systems. Proc. Int. Conj. on Parallel Processing, 1990.
	14	H. Honda, K. Aids, M. Olmmoto, A. Yoshida, W. Ogata, and H. Kasahara. Fortran macro-datafiow compiler. Proceedings of Fourth Workshop on Compilers for Parallel Computers, Dec. 1993.
	15	H. Kasahara. Parallel processing technology. Corona Pub. in Japan, 1991.
	16	H. Ka~ahara, H. Honda, K. Aids, M. Okamoto, and S. Narita. OSCAR Fortran compiler. Proc. Workshop on Compilation of (Symbolic) Languages for Parallel Computers in 1991 {nt. Logic Programming Symposium, 1991.
	17	Hironori Kasahara , Hiroki Honda , A. Mogi , A. Ogura , K. Fujiwara , Seinosuke Narita, A Multi-Grain Parallelizing Compilation Scheme for OSCAR (Optimally Scheduled Advanced Multiprocessor), Proceedings of the Fourth International Workshop on Languages and Compilers for Parallel Computing, p.283-297, August 07-09, 1991
	18	Peng Tu , David A. Padua, Automatic Array Privatization, Proceedings of the 6th International Workshop on Languages and Compilers for Parallel Computing, p.500-521, August 12-14, 1993
	19	Rudolf Eigenmann, Toward a methodology of optimizing programs for high-performance computers, Proceedings of the 7th international conference on Supercomputing, p.27-36, July 19-23, 1993, Tokyo, Japan [doi>10.1145/165939.165948]
	20	Zhiyuan Li, Array privatization for parallel execution of loops, Proceedings of the 6th international conference on Supercomputing, p.313-322, July 19-24, 1992, Washington, D. C., United States [doi>10.1145/143369.143426]
	21	High Performance Fortran Forum. High performance oOrtran language specification draft ver. l.0. High Perrmance Pbrtran Pbrum, 1993.
	22	Seema Hiranandani , Ken Kennedy , Charles Koelbel , Ulrich Kremer , Chau-Wen Tseng, An Overview of the Fortran D Programming System, Proceedings of the Fourth International Workshop on Languages and Compilers for Parallel Computing, p.18-34, August 07-09, 1991
	23	J. Li , M. Chen, Compiling Communication-Efficient Programs for Massively Parallel Machines, IEEE Transactions on Parallel and Distributed Systems, v.2 n.3, p.361-376, July 1991 [doi>10.1109/71.86111]
	24	J. Ramanujam , P. Sadayappan, Compile-Time Techniques for Data Distribution in Distributed Memory Machines, IEEE Transactions on Parallel and Distributed Systems, v.2 n.4, p.472-482, October 1991 [doi>10.1109/71.97903]
	25	T. S. Chen , J. P. Sheu, Communication-Free Data Allocation Techniques for Parallelizing Compilers on Multicomputers, IEEE Transactions on Parallel and Distributed Systems, v.5 n.9, p.924-938, September 1994 [doi>10.1109/71.308531]
	26	M. Gupta , P. Banerjee, Demonstration of Automatic Data Partitioning Techniques for Parallelizing Compilers on Multicomputers, IEEE Transactions on Parallel and Distributed Systems, v.3 n.2, p.179-193, March 1992 [doi>10.1109/71.127259]
	27	Jennifer M. Anderson , Monica S. Lam, Global optimizations for parallelism and locality on scalable parallel machines, Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation, p.112-125, June 21-25, 1993, Albuquerque, New Mexico, United States
	28	Lubomir Bic , Alexandru Nicolau , Mitsuhisa Sato, Parallel Language and Compiler Research in Japan, Kluwer Academic Publishers, Norwell, MA, 1995
	29	K. Aids, K. Iwasaki, H. Kasahara, and S. Narita. Performance evaluation of macro-datafiow computation on shared memory multiprocessors. Proceedings of IEEE Pacific Rim Conference on Communications, Computers, and Signal Processing, 1995.
	30	M. Okamoto, K. Yamashita, H. Kasahara, and S. Narita. Hierarchical macro-datafiow computation scheme on a multiprocessor system OSCAR. Proceedings of iEEE Pacific Rim Conference on Communications, Computers, and Signal Processing, 1995.
	31	H. Honda, K. Aids, M. Okamoto, and H. Kasahara. Coarse grain parallel execution scheme of a Fortran program on OSCAR. Trans. IEICE(in Japanese), J75-D- I(8):526-535, 1992.
	32	Jeanne Ferrante , Karl J. Ottenstein , Joe D. Warren, The program dependence graph and its use in optimization, ACM Transactions on Programming Languages and Systems (TOPLAS), v.9 n.3, p.319-349, July 1987 [doi>10.1145/24039.24041]
	33	F. Allen , M. Burke , R. Cytron , J. Ferrante , W. Hsieh, A framework for determining useful parallelism, Proceedings of the 2nd international conference on Supercomputing, p.207-215, June 1988, St. Malo, France [doi>10.1145/55364.55385]
	34	M. Girkar , C. D. Polychronopoulos, Automatic Extraction of Functional Parallelism from Ordinary Programs, IEEE Transactions on Parallel and Distributed Systems, v.3 n.2, p.166-178, March 1992 [doi>10.1109/71.127258]
	35	Utpal K. Banerjee, Loop Transformations for Restructuring Compilers: The Foundations, Kluwer Academic Publishers, Norwell, MA, 1993
	36	W. Ogata, K. Fujimoto, M. Oota, and H. Kasahara. Compilation scheme for near fine grain parallel processing on a multiprocessor system without explicit synchronization, trroceedings bf IEEE Pacific R,~n Conference on Communications, Computers, and Signal Process~ng, 1995.