Global optimization techniques for automatic parallelization of hybrid applications

This paper presents a novel technique to perform global optimization of communication and preprocessing calls in the presence of array accesses with arbitrary subscripts. Our scheme is presented in the context of automatic parallelization of sequential programs to produce message passing programs for execution on distributed machines. We use the static single assignment (SSA) form for message passing programs as the intermediate representation and then present techniques to perform global optimizations even in the presence of arra y accesses with arbitrary subscripts.The focus of this paper is in showing that, using a uniform compilation method both at compile-time and at run-time, our framework is able to determine the earliest and the latest legal communication point for a certain distributed array reference even in the presence of arbitrary array addressing functions. Our scheme then heuristically determines the nal communication point after considering the interaction bet w een th...

• Type: Conference
• Year: 2001
• Where: ICS
• Authors: Dhruva R. Chakrabarti, Prithviraj Banerjee
• Keywords: Array Addressing Functions, Distributed And Parallel Computing, ICS 2001, Message Passing Programs, Run-time Routines