A new optimization algorithm for program modularization

Authors:
Saeed Parsa;Amir Mehrabi-Jorshary;Mohammad Hamzei
Affiliations:
Department of Computer Engineering, Iran University of Science and Technology, Tehran, Iran;Department of Computer Engineering, Iran University of Science and Technology, Tehran, Iran;Department of Computer Engineering, Iran University of Science and Technology, Tehran, Iran
Venue:
ICICA'10 Proceedings of the First international conference on Information computing and applications
Year:
2010

Citing 7
Cited 0

PANGAEA: An Automatic Distribution Front-End for JAVA

Proceedings of the 11 IPPS/SPDP'99 Workshops Held in Conjunction with the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing
Modular Construction and Composition of Distributed Software Architectures

PDSE '98 Proceedings of the International Symposium on Software Engineering for Parallel and Distributed Systems
The Design and Implementation of a Framework for Automatic Modularization of Software Systems

The Journal of Supercomputing
Towards Autonomic Distribution of Existing Object Oriented Programs

ICAS '06 Proceedings of the International Conference on Autonomic and Autonomous Systems
On the Optimal Object-Oriented Program Re-modularization

ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
Automatic distribution of sequential code using javasymphony middleware

SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
An improved technique for program remodularization

HPCA'09 Proceedings of the Second international conference on High Performance Computing and Applications

Quantified Score

Hi-index	0.02

Visualization

Abstract

The aim has been to achieve the highest degree of possible concurrency in the execution of distributed program modules. To achieve this, a new invocation reordering algorithm is offered in this paper. The algorithm attempts to increase the time interval between each remote call instruction and the very first instructions using the values effected by the remote call. In order to increase the time distance, the algorithm reshuffles invocations, when possible, such that local invocations move in between remote calls and the instructions applying the results of the calls. The evaluation results indicate that the proposed algorithm provides higher degree of concurrency compared with the existing instruction reordering algorithms.