Mapping Distributed Object-Oriented Software to Architecture with Limited Number of Processors

Over the last few years, designers and engineers utilized the Object-Oriented (OO) approach in developing distributed software systems. One of the most important aspects of the Distributed Object Oriented (DOO) systems is the efficient distribution of software classes among different nodes. The initial design of the DOO application does not necessarily have the best class distribution and may need to be restructured. Previous restructuring techniques have not been considered DOO software. Within the context of DOO systems, it is a challenge to perform class restructuring due to the complexity of interactions between objects. In this paper, we propose a new methodology for efficiently restructuring the DOO software classes on a set of nodes in a distributed system. The proposed methodology consists of two phases. The first phase is partitioning the OO system into subsystems that have low coupling and are more suitable for distribution using a recursive graph bi-partitioning algorithm. The second phase is accomplished by mapping the generated subsystems to a set of available machines in the target distributed architecture. The results obtained from the simulated experiments approved that our approaches outperforms the traditional K-Partitioning algorithm.