Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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.
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.
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.
Chen, L. T. and Suda, T. (1997) Designing Mobile Computing Systems Using Distributed Objects. IEEE Communications Magazine 35, 62–70.
Coulouris, G., Dollimore, J., and Kindberg, T. (2005) Distributed Systems: Concepts and Design, Addison-Wesley, Reading, MA.
Floyd, R. W. (1962) Algorithm 97 (Shortest Path). Communications of the ACM 5, 345.
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.
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.
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.
Shatz, S. M. (1993) Development of Distributed Software: Concepts and Tools, Macmillan, New York.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Barney, H.T., Low, G.C. (2009). An Improved Partitioning Method for Distributed Object-Oriented Systems. In: Wojtkowski, W., Wojtkowski, G., Lang, M., Conboy, K., Barry, C. (eds) Information Systems Development. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-68772-8_22
Download citation
DOI: https://doi.org/10.1007/978-0-387-68772-8_22
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-30403-8
Online ISBN: 978-0-387-68772-8
eBook Packages: Computer ScienceComputer Science (R0)