An Improved Partitioning Method for Distributed Object-Oriented Systems

  • Hamish T. Barney
  • Graham C. Low


The design of distributed systems involves the partitioning of the system into components or partitions and the allocation of these components to physical nodes. Techniques have been proposed for both the partitioning and allocation process. However, these techniques suffer from a number of limitations. For instance, object replication has the potential to greatly improve the performance of an object oriented distributed system but can be difficult to use effectively and existing techniques offer limited support for developing and harnessing object replication. An improved technique for partitioning of object-oriented distributed systems is proposed which incorporates support for static object replication, improved concurrency identification and class similarity. It builds on existing techniques from the field of distributed systems. The technique developed is demonstrated and tested on an example system. The new technique is compared with existing partitioning techniques in order to demonstrate both the validity and superiority of the new technique.


Sequence Diagram Travel Agent Class Similarity Concurrency Identification Concurrency Analysis 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. Barney, H. T. and Low, G. C. (2006) Harnessing Replication in Object Allocation. In Camel, A. (Ed.) XVI. International Conference on Computer and Information Science and Engineering. Venice, pp. 129–134.Google Scholar
  2. Chang, C. K., Cleland-Huang, J., Hua, S., and Kuntzmann-Combelles, A. (2001) Function-Class Decomposition: A Hybrid Software Engineering Method. IEEE Computer 34, 87–93.Google Scholar
  3. Chang, W. T. and Tseng, C. C. (1995) Clustering Approach to Grouping Objects in Message-Passing Systems. Journal of Object Orientated Programming 7, 42–43 and 46–50.Google Scholar
  4. Chen, L. T. and Suda, T. (1997) Designing Mobile Computing Systems Using Distributed Objects. IEEE Communications Magazine 35, 62–70.CrossRefGoogle Scholar
  5. Coulouris, G., Dollimore, J., and Kindberg, T. (2005) Distributed Systems: Concepts and Design, Addison-Wesley, Reading, MA.Google Scholar
  6. Floyd, R. W. (1962) Algorithm 97 (Shortest Path). Communications of the ACM 5, 345.CrossRefGoogle Scholar
  7. Huang, J. L. and Chang, C. K. (2000) Supporting the Partitioning of Distributed Systems with Function-Class Decomposition. The 24th Annual International Computer Software and Applications Conference (COMPSAC 2000), pp. 351–356.Google Scholar
  8. Low, G. C. and Rasmussen, G. (2000) Partitioning and Allocation of Objects in Distributed Application Development. Journal of Research and Practice on Information Technology, 32, 75–106.Google Scholar
  9. Savonnet, M., Terasse, M.-N., and Yetongnon, K. (1999) FRAGTIQUE: An OO Distribution Design Methodology. 6th International Conference on Advanced Systems for Advanced Applications, pp. 283–290.Google Scholar
  10. Shatz, S. M. (1993) Development of Distributed Software: Concepts and Tools, Macmillan, New York.MATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  • Hamish T. Barney
  • Graham C. Low

There are no affiliations available

Personalised recommendations