This paper presents an overview of the SUIF compiler, which automatically parallelizes and optimizes sequential programs for shared-memory multiprocessors. We describe new technology in this system for locating coarse-grain parallelism and for optimizing multiprocessor memory behavior essential to obtaining good multiprocessor performance. These techniques have a signi cant impact on the performance of half of the NAS and SPECfp95 benchmark suites. In particular, we achieve the highest SPECfp95 ratio to date of 63.9 on an eight-processor 440MHz Digital AlphaServer.
Current parallelizing compilers for message-passing machines only support a limited class of data-pa...
This paper describes methods to adapt existing optimizing compilers for sequential languages to prod...
A wide variety of computer architectures have been proposed to exploit parallelism at different gran...
As moderate-scale multiprocessors become widely used, we foresee an increased demand for effective c...
Compiler infrastructures that support experimental research are crucial to the advancement of high-p...
Clusters of Symmetrical Multiprocessor machines are increasingly becoming the norm for high performa...
This paper presents the preliminary design of SUIF Explorer, a system that uses state-ofthe -art par...
Effective memory hierarchy utilization is critical to the performance of modern multiprocessor archi...
This work identifies practical compiling techniques for scalable shared memory machines. For this, w...
“A Data Locality Optimizing Algorithm ” was one of the first pa-pers published as part of the SUIF p...
Current parallelizing compilers for message-passing machines only support a limited class of data-pa...
In this paper we analyze the effect of compiler optimizations on fine grain parallelism in scalar pr...
This paper describes our implementation of the program representations which lay the foundation for ...
Advances in integrated circuit technology continue to provide more and more transistors on a chip. C...
This paper presents a model to evaluate the performance and overhead of parallelizing sequential cod...
Current parallelizing compilers for message-passing machines only support a limited class of data-pa...
This paper describes methods to adapt existing optimizing compilers for sequential languages to prod...
A wide variety of computer architectures have been proposed to exploit parallelism at different gran...
As moderate-scale multiprocessors become widely used, we foresee an increased demand for effective c...
Compiler infrastructures that support experimental research are crucial to the advancement of high-p...
Clusters of Symmetrical Multiprocessor machines are increasingly becoming the norm for high performa...
This paper presents the preliminary design of SUIF Explorer, a system that uses state-ofthe -art par...
Effective memory hierarchy utilization is critical to the performance of modern multiprocessor archi...
This work identifies practical compiling techniques for scalable shared memory machines. For this, w...
“A Data Locality Optimizing Algorithm ” was one of the first pa-pers published as part of the SUIF p...
Current parallelizing compilers for message-passing machines only support a limited class of data-pa...
In this paper we analyze the effect of compiler optimizations on fine grain parallelism in scalar pr...
This paper describes our implementation of the program representations which lay the foundation for ...
Advances in integrated circuit technology continue to provide more and more transistors on a chip. C...
This paper presents a model to evaluate the performance and overhead of parallelizing sequential cod...
Current parallelizing compilers for message-passing machines only support a limited class of data-pa...
This paper describes methods to adapt existing optimizing compilers for sequential languages to prod...
A wide variety of computer architectures have been proposed to exploit parallelism at different gran...