An Improved Technique for Program Remodularization
There has been a tremendous shift towards using clusters and networks of low-cost computers for high performance computing. High performance can be achieved by appropriate remodularization of computationally intensive programs. An appropriate modular structure of program exploits the inherent concurrency in the execution of the program. In this article a new relation to determine suitable modular structure for distributing programs across the network is presented. The relation is built automatically by analyzing the program call flow graph. The proposed relation outperforms the existing relation for computing the amount of concurrency in a distributed code by considering, situations in which more than one method are supposed to be executed on a single computational node.
Program remodularization Performance evaluation Automatic parallelization
Saeed Parsa Mohammad Hamzei
Computer Engineering Department Iran University of Science and Technology, Tehran, Iran
国际会议
The Second International Conference on High Performance Computing and Applications(第二届高性能计算及应用国际会议)
上海
英文
305-310
2009-08-10（万方平台首次上网日期，不代表论文的发表时间）