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.
KeywordsProgram remodularization Performance evaluation Automatic parallelization
Unable to display preview. Download preview PDF.
- 3.Deb, D., Fuad, M., Oudshoorn, M.: Towards Autonomic Distribution of Existing Object Oriented Programs. In: International Conference on Autonomic and Autonomous Systems, 2006, p. 17 (2006)Google Scholar
- 6.Astley, M., Agha, G.: Modular construction and composition of distributed software architectures. In: PDSE 1998: Proceedings of the International Symposium on Software Engineering for Parallel and Distributed Systems, Washington, DC, USA, p. 2. IEEE Computer Society, Los Alamitos (1998)Google Scholar
- 9.Schoeberl, M.: A time predictable Java processor. In: Proceedings of Design, Automation and Test in Europe, 2006. DATE 2006, vol. 1 (2006)Google Scholar
- 10.Schoeberl, M.: Jop: A java optimized processor for embedded real-time systems. Technischen Universität Wien, Fakultät für Informatik (2005)Google Scholar