J-F.Collard. Array SSA for Explicitly Parallel Programs. Euro-Par'99, 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Compiler Optimization Techniques for OpenMP Programs - Satoh, Kusano, Sato (Correct)
....Srinivasan[5] point out the advantages of relaxed memory consistency for compiler optimizations. Static single assignment(SSA) form for parallel programs are proposed by Srinivasan et al. 25] Novillo et al. 16] and Lee et al. 15] present optimization algorithm using concurrent SSA form. Collard [3] propose array SSA form for parallel programs. Knoop and Ste en[10] present code motion algorithm for ############# parallel programs. Krishnamurthy and Yelick [13] propose communication optimization for SPMD program with shared variables. Pugh and Rosser [17] present communication optimization ....
J-F.Collard. Array SSA for Explicitly Parallel Programs. Euro-Par'99, 1999.
Compiler Optimization Techniques for OpenMP Programs - Satoh, Kusano, Sato (2000) (Correct)
....point out the advantages of relaxed memory consistency for compiler optimizations. Static single assignment (SSA) form for parallel programs was proposed by Srinivasan et al. 25] Novillo et al. 16] and Lee et al. 15] presented optimization algorithms using concurrent SSA form. Collard [3] proposed array SSA form for parallel programs. Knoop and Ste en[10] presented a code motion algorithm for cobegin coend parallel programs. Krishnamurthy and Yelick [13] proposed communication optimization for SPMD programs with shared variables. Pugh and Rosser [17] presented communication ....
J-F.Collard. Array SSA for Explicitly Parallel Programs. Euro-Par'99, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC