By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Hamad, S.H. ; Ain Shams Univ., Cairo ; Fergany, T. ; Ammar, R.A. ; Solit, S.

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.

Published in:

Signal Processing and Information Technology, 2007 IEEE International Symposium on

Date of Conference:

15-18 Dec. 2007