Expert Programmer versus Parallelizing Compiler: A Comparative Study of Two Approaches for Distributed Shared Memory

Scientific Programming

Volumn 5, Issue 1, 1996, Pages 63-88

  O'Boyle M F P ^a   Bull, J M ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEMS PROGRAMMING; DISTRIBUTED COMPUTER SYSTEMS; FORTRAN (PROGRAMMING LANGUAGE); NATURAL SCIENCES COMPUTING; OPTIMIZATION; PERFORMANCE; PROGRAM COMPILERS;

DISTRIBUTED SHARED MEMORY; PARALLEL PROGRAMMING; PARALLEL SCIENTIFIC COMPUTING; PROGRAMMERS; SCIENTIFIC PROGRAM;

PARALLEL PROCESSING SYSTEMS;

EID: 0030107015     PISSN: 10589244     EISSN: None     Source Type: Journal    
DOI: 10.1155/1996/141895     Document Type: Article

References (19)

1. A. P. R., Forge 90: Automatic Parallelizer for High Performance Fortran 77 on Distributed Memory System User's Guide. Placerville. CA: Applied Parallel Research, 1993.
2. F. Bodin and M. O’Boyle, A Compiler Strategy for SVM, in B. Szymanski and B. Sinharov, Eds., Languages, Compilers and Run-Time Systems for Scalable Computers, Kluwer Academic Publishers, May 1995, pp. 57–68.
3. F. Bodin, P. Beckman. D. Gannon, and J. G. S. Srinivas, “Sage+ + : A Class Library for Building Fortran and C + + Restructuring Tools.” presented at the Second Object-Oriented Numerics Conference. Oregon. April 1994.
4. H. Burkhart and R. Millen, “Performance-measurement tools in a multiprocessor environment.' IEEE Trans. Comput.. vol. 38, pp. 725–737. 1989.
5. M. E. Crovella and T. J. LeBlanc, “The search for lost cycles: a new approach to parallel program performance evaluation,” University of Rochester, Department of Computer Science. Tech. Rep. 479, December 1993.
6. G. K. Egan. G. D. Riley, and J. M. Bull “Parallelisation of the SDEM distinct element stress analysis code on the KSR-1. in Proc. ACM International Conference on Supercompuling. pp. 85–92. 1994.
7. C. Falco Korn, J. M. Bull. G. D. Riley, and P. K. Stansby, “Parallelisation of a three-dimensional shallow water estuary model on the KSR-1,” Sci. Prog, vol 4, no. 3, pp. 155–170, 1995.
8. M. Gupta, “Automatic data partitioning on distributed memory multicomputers.” University of Illinois at Urbana-Champaign, Centre for Reliable and High Performance Computing, Tech. Rep. UILU-ENG-92-2237, CRHC-92-19. September 1992.
9. W. Kelly and W. Pugh, “Generating schedules and code within a unified reordering transformation framework,” University of Maryland Tech. Rep. UMIACS-TR-92-126, August 1992.
10. K. S. R., KSR Fortran Programming, Waltham, MA: Kendall Square Research. 1992.
11. J. Li and M. Chen, “Index domain alignment: minimising cost of cross-referencing between distributed arrays,” in IEEE Proc. Third Symposium on the Frontiers of Massively Parallel Computation, pp.424–433, 1990.
12. L.-C. Lu, “A unified framework for systematic loop transformations,” presented at the 3rd ACM Symposium on the Principles and Practice of Parallel Programming, 1991.
13. M. F. P. O’Boyle, “Program and data transformation for efficient execution on distributed memory architectures,” University of Manchester, Tech. Rep. 93-1-6, January 1993.
14. M. F. P. O’Boyle, “A data partitioning algorithm for distributed memory compilation.” in Proc. of PARLE 94. New York: Springer Verlag, 1994.
15. M. F. P. O’Boyle, “Hierarchical locality optimisations for NUMAs,” in Proc. EuroMicro PDP, Sanremo, pp. 106–114, 1995.
16. D. A. Padua and M. J. Wolfe. “Advanced compiler optimizations for supercomputers,” Common. ACM vol. 29, pp. 1184–1201. 1986.
17. W. Pugh, “Uniform techniques for loop optimisation,” presented at the International Conference on Supercomputing, 1991.
18. M. Wolfe. “Optimising supercompilers for supercomputers,’’ in C. Jesshope and D. Klappholz, Eds., Research Monographs in Parallel and Distributed Computing. London: Pitman. 1989.
19. M. E. Wolf and M. Lam. “An algorithmic approach to compound loop transformations, in Advances in Languages and Compilers for Parallel Processing. A. Nicolau. D. Gelernter. T. Gross, and D. Padua, Eds.. London, pp. 243–259. 1991.