The Community for Technology Leaders
Parallel Computing in Electrical Engineering, 2004. International Conference on (2006)
Bialystok, Poland
Sept. 13, 2006 to Sept. 17, 2006
ISBN: 0-7695-2554-7
pp: 161-166
Aasish Kumar Pappu , iiita.ac.in
Sudip Sanyal , iiita.ac.in
K. Sarath Kumar , iiita.ac.in
K. Ashwin Kumar , iiita.ac.in
ABSTRACT
Automatic parallelization of a sequential code is about finding parallel segments in the code and executing these segments parallely by sending them to different computers in a grid. Basically, parallel segments in the code can be found by doing block level analysis, instruction level analysis or function level analysis. Block is any continuous part of the code that performs a particular task. This paper talks about a hybrid approach that combines the block level analysis with functional level analysis for parallelization of sequential code and its illustrates its advantages over block level parallelization and function level parallelization performed independently. In this approach, segments of code are identified as basic blocks. These blocks are analyzed to identify them as parallelizable or dependent. Loops which are also identified as blocks are parallelized using existing loop parallelization techniques [1]. This information would be used for automatic parallel processing of the set of independent blocks on different nodes in the grid using Message Passing Interface(MPI). The system will annotate the MPI library functions to the program at appropriate positions in the source code to proceed with the automatic parallelization and execution of the program.
INDEX TERMS
Block level parallelization, Instruction level parallelization, Function level parallelization, Loop level parallelization, Automatic parallelization
CITATION
Aasish Kumar Pappu, Sudip Sanyal, K. Sarath Kumar, K. Ashwin Kumar, "Hybrid Approach for Parallelization of Sequential Code with Function Level and Block Level Parallelization", Parallel Computing in Electrical Engineering, 2004. International Conference on, vol. 00, no. , pp. 161-166, 2006, doi:10.1109/PARELEC.2006.44
88 ms
(Ver 3.3 (11022016))