Article

Free access

Measuring the effectiveness of automatic parallelization in SUIF

Authors:

Byoungro So,

Sungdo Moon, and

Mary W. HallAuthors Info & Claims

ICS '98: Proceedings of the 12th international conference on Supercomputing

July 1998

Pages 212 - 219

https://doi.org/10.1145/277830.277876

Published: 13 July 1998 Publication History

PDF eReader

References

[1]

S. P. Amarasinghe. Parallelizing Compiler Techniques Based on Linear Inequalities. PhD thesis, Dept. of Electrical Engineering, Stanford University, January 1997.

Digital Library

Google Scholar

[2]

W. Blume, R. Doallo, R. Eigenmann, J. Grout, J. Hoeflinger, T. Lawrence, J. Lee, D. Padua, Y. Pack, B. Pottenger, L. Rauchwerger, and P. Tu. Parallel programming with Polaris. IEEE Computer, 29( 12):78-82, December 1996.

Digital Library

Google Scholar

[3]

W. Blume and R. Eigenmann. Performance analysis of parallelizing compilers on the Perfect Benchmark programs. IEEE Transaction on Parallel and Distributed Systems, 3(6):643-656, November 1992.

Digital Library

Google Scholar

[4]

K. I). Cooper, M. W. Hall, R. T. Hood, K. Kennedy, K. S. McKinley, J. M. Mellor-Cmmmey, L. Torczon, and S. Warren. The ParaS- cope parallel programming environment. Proceedings of the IEEE, 81 (2):244-263, Feburary 1993.

Crossref

Google Scholar

[5]

K. D. Cooper, M. W. Hall, and K. Kennedy. A methodology for procedure cloning. Computer Languages, 19(2):105-117, April 1993.

Digital Library

Google Scholar

[6]

G. Goff. Practical techniques to augment dependence analysis in the presence of symbolic terms. Technical Report TR92-194, Dept. of Computer Science, Rice University, October 1992.

Digital Library

Google Scholar

[7]

J. Gu, Z. Li, and G. Lee. Symbolic array dataflow analysis for array privatization and program parallelization. In Proceedings of Supercomputing '95, San Diego, California, December 1995.

Digital Library

Google Scholar

[8]

M.W. Hall, S. P. Amarasinghe, B. R. Murphy, S.-W. Liao, and M. S. Lam. Detecting coarse-grain parallelism using an interprocedural parallelizing compiler. In Pwceedings of Supercomputing '95, San Diego, California, December 1995.

Digital Library

Google Scholar

[9]

M. W. Hall, J. M. Anderson, S. P. Amarasinghe, B. R. Murphy, S.- W. Liao, E. Bugnion, and M. S. Lam. Maximizing multiprocessor performance with the SUIF compiler. IEEE Computer, 29( 12):84-89, December 1996.

Digital Library

Google Scholar

[10]

M. W. Hall, B. R. Murphy, S. P. Amarasinghe, S.-W. Liao, and M. S. Lam. Interprocedural analysis for parallelization. In Proceedings of the 8th International Workshop on Languages and Compilers fi~r Parallel Computing, pages 61-80, Columbus, Ohio, August 1995.

Digital Library

Google Scholar

[11]

E Irigoin, P. Jouvelot, and R. Triolet. Semantical interprocedural parallelization: An overview of the PIPS project. In Proceedings of the 1991 ACM International Conference on Supercomputing, pages 244- 251, Cologne, Germany, June 1991.

Digital Library

Google Scholar

[12]

T. Lawrence. Implementation of run time techniques in the Polaris Fortran restructurer. Master's thesis, Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1996.

Google Scholar

[13]

S.-W. Liao, J. Robert P. Bosch, A. GhuIoum, and M. S. Lam. SUIF Explorer: A programming assistant for parallel machines. In Proceedings of the 2nd SUIF Compiler Workshop, August 1997.

Google Scholar

[14]

K.S. McKinley. Automatic and Interactive Parallelization. PhD thesis, Dept. of Computer Science, Rice University, April 1992.

Digital Library

Google Scholar

[15]

J. Mellor-Crummey. Compile-time support for efficient data race detection in shared-memory parallel programs. In Proceedings of ACM/ONR Workshop on Parallel and Distributed Debugging, pages 129-139, May 1993.

Digital Library

Google Scholar

[16]

S. Moon, M. W. Hall, and B. R. Murphy. Predicated array data-flow analysis fo run-time parallelization. In Proceedings of the 1998 ACM International Conference on Supercomputing, Melbourne, Australia, July 1998.

Digital Library

Google Scholar

[17]

R. Ponnusamy, J. Saltz, A. Choudhary, Y.-S. Hwang, and G. Fox. Runtime support and compilation methods for user-specified irregular data distributions, iEEE Transaction on Parallel and Distributed Systems, 6(8):815-831, August 1995.

Digital Library

Google Scholar

[18]

W. Pugh and D. Wonnacott. Eliminating false data dependences using the Omega test. In Proceedings of the ACM SiGPLAN '92 Conference on Programming Language Design and Implementation, pages 140- 15 l, San Francisco, California, June 1992.

Digital Library

Google Scholar

[19]

L. Rauchwerger and D. Padua. The LRPD test: Speculative run-time parallelization of loops with privatization and reduction parallelization. In Proceedings of the ACM SIGPLAN '95 Conference on Programming Language Design and Implementation, pages 218-232, La Jolla, California, June 1995.

Digital Library

Google Scholar

[20]

J. P. Singh and J. L. Hennessy. An empirical investigation of the effectiveness and limitations of automatic parallelization. In Proceedings of the International Symposium on Shared Memory Multiprocessing, April 1991.

Google Scholar

[21]

P. Tu. Automatic Array Privatization and Demand-driven Symbolic Analysis. PhD thesis, Dept. of Computer Science, University of Illinois at Urbana-Champaign, May 1995.

Digital Library

Google Scholar

[22]

P. Tu and D. Padua. Automatic array privatization. In Proceedings of the 6th International Workshop on Languages and Compilers .for Parallel Computing, pages 500-521, Portland, Oregon, August 1993.

Digital Library

Google Scholar

Cited By

View all

Pearce DKelly PHankin C(2007)Efficient field-sensitive pointer analysis of CACM Transactions on Programming Languages and Systems10.1145/1290520.129052430:1(4-es)Online publication date: 1-Nov-2007
https://dl.acm.org/doi/10.1145/1290520.1290524
Chen MOlukotun KJohnson RConte THwu W(2003)TESTProceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization10.5555/776261.776294(301-312)Online publication date: 23-Mar-2003
https://dl.acm.org/doi/10.5555/776261.776294
Chen MOlukotun K(2003)The Jrpm system for dynamically parallelizing Java programsACM SIGARCH Computer Architecture News10.1145/871656.85966831:2(434-446)Online publication date: 1-May-2003
https://dl.acm.org/doi/10.1145/871656.859668
Show More Cited By

Index Terms

Measuring the effectiveness of automatic parallelization in SUIF

Recommendations

Evaluating Automatic Parallelization in SUIF

This paper presents the results of an experiment to measure empirically the remaining opportunities for exploiting loop-level parallelism that are missed by the Stanford SUIF compiler, a state-of-the-art automatic parallelization system targeting shared-...
Read More
Interprocedural parallelization analysis in SUIF

As shared-memory multiprocessor systems become widely available, there is an increasing need for tools to simplify the task of developing parallel programs. This paper describes one such tool, the automatic parallelization system in the Stanford SUIF ...
Read More
Automatic parallelization of nonuniform loops
Read More

Comments

Information & Contributors

Information

Published In

ICS '98: Proceedings of the 12th international conference on Supercomputing

July 1998

464 pages

ISBN:089791998X

DOI:10.1145/277830

Chairmen:
Greg Egan
Monash Univ.
,
Richard Brent
Oxford Univ.; and Australian National Univ., Canberra, Australia
,
Dennis Gannon
Indiana Univ.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 July 1998

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ICS98

Sponsor:

SIGARCH
IEEE-CS

ICS98: 1998 International Conference on Supercomputing

Melbourne, Australia

Acceptance Rates

Overall Acceptance Rate 629 of 2,180 submissions, 29%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
337
Total Downloads

Downloads (Last 12 months)20
Downloads (Last 6 weeks)5

Other Metrics

View Author Metrics

Citations

Cited By

View all

Pearce DKelly PHankin C(2007)Efficient field-sensitive pointer analysis of CACM Transactions on Programming Languages and Systems10.1145/1290520.129052430:1(4-es)Online publication date: 1-Nov-2007
https://dl.acm.org/doi/10.1145/1290520.1290524
Chen MOlukotun KJohnson RConte THwu W(2003)TESTProceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization10.5555/776261.776294(301-312)Online publication date: 23-Mar-2003
https://dl.acm.org/doi/10.5555/776261.776294
Chen MOlukotun K(2003)The Jrpm system for dynamically parallelizing Java programsACM SIGARCH Computer Architecture News10.1145/871656.85966831:2(434-446)Online publication date: 1-May-2003
https://dl.acm.org/doi/10.1145/871656.859668
Chen MOlukotun KGottlieb ALi K(2003)The Jrpm system for dynamically parallelizing Java programsProceedings of the 30th annual international symposium on Computer architecture10.1145/859618.859668(434-446)Online publication date: 9-Jun-2003
https://dl.acm.org/doi/10.1145/859618.859668
Chen MOlukotun K(2003)TEST: a Tracer for Extracting Speculative ThreadsInternational Symposium on Code Generation and Optimization, 2003. CGO 2003.10.1109/CGO.2003.1191554(301-312)Online publication date: 2003
https://doi.org/10.1109/CGO.2003.1191554
Moon SSo BHall MMurphy B(2002)A Case for Combining Compile-Time and Run-Time ParallelizationLanguages, Compilers, and Run-Time Systems for Scalable Computers10.1007/3-540-49530-4_7(91-106)Online publication date: 24-Sep-2002
https://doi.org/10.1007/3-540-49530-4_7
Moon SSo BHall M(2000)Evaluating Automatic Parallelization in SUIFIEEE Transactions on Parallel and Distributed Systems10.1109/71.82463911:1(36-49)Online publication date: 1-Jan-2000
https://dl.acm.org/doi/10.1109/71.824639
Huang THsu P(2000)A practical run-time technique for exploiting loop-level parallelismJournal of Systems and Software10.1016/S0164-1212(00)00060-154:3(259-271)Online publication date: 1-Nov-2000
https://dl.acm.org/doi/10.1016/S0164-1212%2800%2900060-1
Moon SSo BHall M(1999)Combining compile-time and run-time parallelization[1]Scientific Programming10.1155/1999/4906287:3-4(247-260)Online publication date: 1-Aug-1999
https://dl.acm.org/doi/10.1155/1999/490628
Miyamoto CLin CPancake C(1999)Evaluating titanium SPMD programs on the Tera MTAProceedings of the 1999 ACM/IEEE conference on Supercomputing10.1145/331532.331575(43-es)Online publication date: 1-Jan-1999
https://dl.acm.org/doi/10.1145/331532.331575
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Evaluating Automatic Parallelization in SUIF

Interprocedural parallelization analysis in SUIF

Automatic parallelization of nonuniform loops