A data-localization compilation scheme using partial-static task assignment for Fortran coarse-grain parallel processing

Parallel Computing

Volumn 24, Issue 3-4, 1998, Pages 579-596

  Kasahara, Hironori ^a   Yoshida, Akimasa ^b  

^a WASEDA UNIVERSITY   (Japan)

^b TOHO UNIVERSITY   (Japan)

Author keywords

Automatic data distribution; Coarse grain parallel processing; Data localization; Dynamic scheduling; Parallelizing compilers

Indexed keywords

CODES (SYMBOLS); COMPUTER SYSTEMS PROGRAMMING; DATA ACQUISITION; DATA TRANSFER; FLOWCHARTING; FORTRAN (PROGRAMMING LANGUAGE); PARALLEL PROCESSING SYSTEMS; RESPONSE TIME (COMPUTER SYSTEMS); STORAGE ALLOCATION (COMPUTER);

COARSE GRAIN PARALLEL PROCESSING; DATA LOCALIZATION COMPILATION SCHEMES; MACRO DATAFLOW PROCESSING; OPTIMALLY SCHEDULED ADVANCED MULTIPROCESSOR (OSCAR) SYSTEMS; PARTIAL STATIC TASK ASSIGNMENT;

PROGRAM COMPILERS;

EID: 0032064781     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(98)00026-X     Document Type: Article

References (39)

1. W. Blume, R. Doallo, R. Eigenmann, J. Grout, J. Hoeflinger, T. Lawrence, J. Lee, D. Padua, Y. Paek, B. Pottenger, P.T.L. Rauchwerger, Advanced program-restructuring for high-performance computers with Polaris, Technical Report 1473, CSRD, University of Illinois, Urbana-Champaign, 1996.
2. S.P. Amarasinghe, J.M. Anderson, M.S. Lam, C.-W. Tseng, The SUIF compiler for scalable parallel machines, Proc. 7th SIAM Conf. Parallel Processing Sci. Comput., 1995.
3. U. Banerjee, R. Eigenmann, A. Nicolau, D.A. Padua, Automatic program parallelization, Proc. IEEE 81 (2) (1993) 211-243.
4. W. Blume, R. Eigenmann, J. Hoeflinger, D. Padua, P. Petersen, L. Rauchwerger, P. Tu, Automatic detection of parallelism: a grand challenge for high-performance computing, IEEE Parallel Distributed Technol. 2 (3) (1994) 37-47.
5. U. Banerjee, Loop Transformations for Restructuring Compilers, Kluwer Academic Pub., 1993.
6. M. Wolfe, High-Performance Compilers for Parallel Computing, Addison-Wesley, 1996.
7. M.E. Wolf, M.S. Lam, A loop transformation theory and an algorithm to maximize parallelism, Trans. IEEE Parallel Distributed Syst. 2 (4) (1991) 452-471.
8. H. Kasahara, H. Honda, S. Narita, Parallel processing of near-fine-grain tasks using static scheduling on OSCAR, IEEE ACM Supercomput. '90, 1990.
9. W. Ogata, A. Yoshida, M. Okamoto, K. Kimura, H. Kasahara, Near-fine-grain parallel processing without explicit synchronization on a multiprocessor system, Proc. 6th Workshop Compilers Parallel Comput., Dec. 1996, pp. 359-370.
10. A.V. Aho, R. Sethi, J.D. Ullman, Compilers (Principles, Techniques and Tools), Addison-Wesley, 1988.
11. H. Honda, M. Iwata, H. Kasahara, Coarse-grain parallelism detection scheme of Fortran programs, Trans. IEICE J73-D-I (12) (1990) 951-960, (in Japanese).
12. D. Gajski, D. Kuck, D. Lawrie, A. Sameh, Cedar. Report UIUCDCS-R-83-1123, Dept. of Computer Sci., Univ. Illinois, Urbana-Champaign, Feb. 1983.
13. D.D. Gajski, D.J. Kuck, D.A. Padua, Dependence-driven computation, Proc. COMPCON 81 Sprint Comput. Conf., 1981, pp. 168-172.
14. H. Kasahara, H. Honda, M. Iwata, M. Hirota, A compilation scheme for macro-dataflow computation on hierarchical multiprocessor systems, Proc. Int. Conf. Parallel Processing, 1990.
15. H. Honda, K. Aida, M. Okamoto, A. Yoshida, W. Ogata, H. Kasahara, Fortran macro-dataflow compiler, Proc. 4th Workshop Compilers Parallel Comput., Dec. 1993, pp. 415-425.
16. H. Kasahara, Parallel Processing Technology, Corona Pub., Japan, 1991.
17. H. Kasahara, H. Honda, K. Aida, M. Okamoto, S. Narita, OSCAR Fortran compiler, Proc. Workshop Compilation (Symbolic) Languages Parallel Comput. 1991 Int. Logic Programming Symp., 1991.
18. H. Kasahara, H. Honda, A. Mogi, A. Ogura, K. Fujiwara, S. Narita, Multi-grain parallelizing compilation scheme for OSCAR, 4th Workshop Language Compilers Parallel Comput., 1991.
19. P. Tu, D. Padua, Automatic array privatization, 6th Annu. Workshop Languages Compilers Parallel Comput., 1993.
20. R. Eigenmann, Toward a methodology of optimizing programs for high-performance computers, Proc. ACM Int. Conf. Supercomput. '93, Jul. 1993, pp. 27-36.
21. Z. Li, Array privatization for parallel execution of loops, Proc. 1992 ACM Int. Conf. Supercomput., 1992, pp. 313-322.
22. High-Performance Fortran Forum, High-performance Fortran language specification draft ver. 1.0, High-Performance Fortran Forum, 1993.
23. S. Hiranandani, K. Kennedy, C. Koelbel, U. Kremer, C.-W. Tseng, An overview of the Fortran D programming system, Proc. 4th Workshop Languages Compilers Parallel Comput., 1991.
24. J. Li, M. Chen, Compiling communication-efficient programs for massively parallel machines, IEEE Trans. Parallel Distributed Syst. 2 (3) (1991) 361-376.
25. J. Ramanujam, P. Sadayappan, Compile-time techniques for data distribution in distributed memory machines, IEEE Trans. Parallel Distributed Syst. 2 (4) (1991) .
26. T.-S. Chen, J.-P. Sheu, Communication-free data allocation techniques for parallelizing compilers on multicomputers, IEEE Trans. Parallel Distributed Syst. 5 (9) (1994) .
27. A. Agarwal, D.A. Kranz, V. Natarajan, Automatic partitioning of parallel loops and data arrays for distributed shared-memory multiprocessors, IEEE Trans. Parallel Distributed Syst. 6 (9) (1995) 943-962.
28. M. Gupta, P. Banerjee, Demonstration of automatic data-partitioning techniques for parallelizing compilers on multicomputers, IEEE Trans. Parallel Distributed Syst. 3 (2) (1992) 179-193.
29. J.M. Anderson, M.S. Lam, Global optimizations for parallelism and locality on scalable parallel machines, Proc. SIGPLAN '93 Conf. Programming Language Design Implementation, 1993, pp. 112-125.
30. L. Bic, A. Nicolau, M. Sato (Eds.), Parallel Language and Compiler Research in Japan, Kluwer Academic Pub., 1995.
31. K. Aida, K. Iwasaki, H. Kasahara, S. Narita, Performance evaluation of macro-dataflow computation on shared memory multiprocessors, Proc. IEEE Pacific Rim Conf. Commun., Comput., Signal Processing, 1995.
32. M. Okamoto, K. Yamashita, H. Kasahara, S. Narita, Hierarchical macro-dataflow computation scheme on a multiprocessor system OSCAR, Proc. IEEE Pacific Rim Conf. Commun., Comput., Signal Processing, 1995.
33. H. Honda, K. Aida, M. Okamoto, H. Kasahara, Coarse-grain parallel execution scheme of a Fortran program on OSCAR, Trans. IEICE J75-D-I (8) (1992) 526-535, (in Japanese).
34. J. Ferrante, K.J. Ottenstein, J.D. Warren, The program-dependence graph and its use in optimization, ACM Trans. Prog. Lang. Syst. 9 (3) (1987) 319-349.
35. F. Allen, M. Burke, R. Cytron, J. Ferrante, W. Hsieh, V. Sarkar, A framework for determining useful parallelism, Proc. 2nd ACM Int. Conf. Supercomput, 1988.
36. M. Girkar, C.D. Polychronopoulos, Automatic extraction of functional parallelism from ordinary programs, IEEE Trans. Parallel Distributed Syst. 3 (2) (1992) 166-178.
37. A. Yoshida, S. Maeda, W. Ogata, H. Kasahara, A data-localization scheme for Fortran macro-dataflow computation, Trans. IPS. Japan 35 (9) (1994) 1848-1860.
38. A. Yoshida, S. Maeda, W. Ogata, H. Kasahara, A data-localization scheme among Doall/Sequential loops for Fortran coarse-grain parallel processing, Trans. IEICE J78-D-I (2) (1995) 162-169, (in Japanese).
39. A. Yoshida, S. Maeda, K. Fujimoto, H. Kasahara, Data-localization for macro-dataflow computation using static macrotask fusion, Proc. 5th Workshop Compilers Parallel Comput., Jun. 1995, pp. 440-453.