Revisiting communication code generation algorithms for message-passing systems

References

• Amarasinghe , S.P. and Lam , M.S. 1993 . “ Communication optimization and code generation for distributed memory machines ” . In Proceedings of the ACM SIGPLAN '93 Conference on Programming Language Design and Implementation (PLDI) , 126 – 138 . New Mexico : Albuquerque .
   Google Scholar
• Amza , C. , Cox , A.L. , Dwarkada , S. , Keleher , P. , Lu , H. , Rajamony , R. , Yu , W. and Zwaenepoel , W. 1996 . TreadMarks: shared memory computing on networks of workstations . IEEE Computer , : 18 – 28 .
   Google Scholar
• Ancourt , C. and Irigoin , F. 1991 . “ Scanning polyhedra with DO loops ” . In Proceedings of Third ACM SIGPLAN Symposium on Principles & Practice of Programming Languages (PPOPP) , 39 – 50 . Virginia : Williamsburg .
   Google Scholar
• Banerjee , U. 1993 . Loop Transformations for Restructuring Compilers: The Foundations , Boston, MA : Kluwer Academic Publishers .
   Google Scholar
• Bokari , S.H. 1981 . On the mapping problem . IEEE Transactions on Computers , C-30 : 207 – 214 .
   Google Scholar
• Carlisle , M.C. and Rogers , A. 1995 . “ Software caching and computation migration in Olden ” . In Proceedings of the Fifth ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming , 29 – 38 . Calif : Santa Barbara .
   Google Scholar
• Cosnard , M. , Jeannot , E. and Yang , T. 1999 . “ SLC: symbolic scheduling for executing parameterized task graphs on multiprocessors ” . In Proceedings of the International Conference on Parallel Processing (ICPP'99) Vol. 99 , 21 – 24 .
   Google Scholar
• Cox , A.L. , Dwarkadas , S. , Lu , H. and Zwaenepoel , W. 1997 . “ Evaluating the performance of software distributed shared memory as a target for parallelizing compilers ” . In Proceedings of the 11th International Parallel Processing Symposium , 475 – 482 . Switzerland : Geneva .
   Google Scholar
• Ferner , C.S. 2002 . “ The Paraguin compiler—Message-passing code generation using SUIF ” . In Proceedings of the IEEE SoutheastCon 2002 1 – 6 . Columbia, SC
   Google Scholar
• Ferner , C.S. and Babb , G. 1999 . Automatic choice of scheduling heuristics for parallel/distributed computing . Scientific Programming , 7 ( 1 ) : 47 – 65 .
   Google Scholar
• Apostolos , Gerasoulis and Yang , Tao . 1992 . A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors . Journal of Parallel and Distributed Computing , 16 ( 4 ) : 276 – 291 .
   Google Scholar
• Jeannot , E. 2001 . “ Automatic multithreaded parallel program generation for message passing multiprocessors using parameterized task graphs ” . In Proceedings of Parallel Computing 2001 (ParCo2001) Naples: Italy
   Google Scholar
• Keleher , P.J. 1999 . Update Protocols and cluster-based shared memory . Computer Communications , 22 ( 11 ) : 1045 – 1055 .
   Google Scholar
• Kessler , C.W. 1996 . “ Parallel Fourier-Motzkin elimination ” . In Proceedings of Euro-Par’96, Lyon, France, August 1996, Springer LNCS 1124 66 – 71 . (Full version of paper available at http://www.ida.liu.se/∼chrke/fork95/a17.ps)
   Google Scholar
• Khan , A.A. , McCreary , C.L. and Jones , M.S. 1994 . “ A comparison of multiprocessor scheduling heuristics ” . In Proceedings of the 23rd International Conference on Parallel Processing
   Google Scholar
• Yu-Kwong , Kwok and Ahmad , Ishfaq . 1999 . Static scheduling algorithms for allocating directed task graphs to multiprocessors . ACM Computing Surveys , 31 ( 4 ) : 406 – 471 .
   Google Scholar
• Lim , A.W. and Lam , S. 1998 . Maximizing parallelism and minimizing synchronization with affine partitions . Parallel Computing , 24 ( 3–4 ) : 445 – 475 .
   Google Scholar
• Maydan , D.E. , Amarasinghe , S.P. and Lam , M.S. 1993 . “ Array data-flow analysis and its use in array privatization ” . In Proceedings of ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages 2 – 15 . Charleston, South Carolina
   Google Scholar
• McCreary , C.L. , Khan , A.A. , Thompson , J.J. and McArdle , M,E, . 1994 . “ A comparison of heuristics for scheduling DAGS on multiprocessors ” . In Proceedings of the 8th International Parallel Processing Symposium 446 – 451 .
   Google Scholar
• Quilleré , F. , Rajopadhye , S. and Wilde , D. 2000 . Generation of efficient nested loops from polyhedra . International Journal of Parallel Programming , 28 ( 5 ) : 469 – 498 .
   Google Scholar
• Ramaswamy , S. , Sapatnekar , S. and Banerjee , P. 1997 . A framework for exploiting task and data parallelism on distributed memory multicomputers . IEEE Transactions on Parallel and Distributed Systems , 8 ( 11 ) : 1098 – 1116 .
   Google Scholar
• Scales, D.J. and Lam, M.S., 1994, An efficient shared memory layer for distributed memory machines, Computer Systems Laboratory Technical Report CSL-TR-94-627, Department of Computer Science, University of Stanford.
   Google Scholar
• Shirazi , B. and Wang , M. 1992 . Analysis and evaluation of heuristic methods for static task scheduling . Journal of Parallel and Distributed Computing , 10 : 222 – 232 .
   Google Scholar
• Split-C, The Computer Science Division, University of California, Berkeley, http://www.cs.berkeley.edu/projects/parallel/castle/split-c/ .
   Google Scholar
• Wolfe , M. 1996 . High Performance Compilers for Parallel Computing , Redwood City, CA : Addison-Wesley Publishing Co. .
   Google Scholar
• Xue , J. 2000 . Loop Tiling for Parallelism , Boston, MA : Kluwer Academic Publishers .
   Google Scholar
• Yang , T. and Fu , C. 1997 . Heuristic algorithms for scheduling iterative task graphs on distributed memory machines . IEEE Transactions on Parallel and Distributed Systems , 8 ( 6 ) : 608 – 622 .
   Google Scholar