This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Maximizing multiprocessor performance with the SUIF compiler
December 1996 (vol. 29 no. 12)
pp. 84,85,86,87,88,89
M.W. Hall, USC Inf. Scis. Inst., Marina del Rey, CA, USA
This article describes automatic parallelization techniques in the SUIF (Stanford University Intermediate Format) compiler that result in good multiprocessor performance for array-based numerical programs. Parallelizing compilers for multiprocessors face many hurdles. However, SUIF's robust analysis and memory optimization techniques enabled speedups on three fourths of the NAS and SPECfp95 benchmark programs.
Index Terms:
mathematics computing,parallelising compilers,multiprocessing systems,performance evaluation,optimising compilers,benchmark programs,multiprocessor performance,SUIF compiler,automatic parallelization techniques,Stanford University Intermediate Format compiler,array-based numerical programs,parallelizing compilers,memory optimization techniques,robust analysis techniques,speedups,NAS,SPECfp95,Parallel processing,Phased arrays,Program processors,Information analysis,Concurrent computing,Privatization,Throughput,Multiprocessing systems,Cache memory,Programming profession
Citation:
E. Bugnion, Shih-Wei Liao, B.R. Murphy, S.P. Amarasinghe, J.M. Anderson, M.W. Hall, M.S Lam, "Maximizing multiprocessor performance with the SUIF compiler," Computer, vol. 29, no. 12, pp. 84,85,86,87,88,89, Dec. 1996, doi:10.1109/2.546613
Usage of this product signifies your acceptance of the Terms of Use.