An Architecture for Distributing the Computation of Software Clustering Algorithms

  • Authors:
  • Brian Mitchell;Martin raverso;Spiros Mancoridis

  • Affiliations:
  • -;-;-

  • Venue:
  • WICSA '01 Proceedings of the Working IEEE/IFIP Conference on Software Architecture
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

Collections of general purpose networked workstations offer processing capability that often rivals or exceeds supercomputers. Since networked workstations are readily available in most organizations, they provide an economic and scalable alternative to parallel machines. In this paper we discuss how individual nodes in computer network can be used as a collection of connected processing elements to improve the performance of software engineering tool that we developed. Our tool, called Bunch, automatically clusters the structure of software systems into hierarchy of subsystems. Clustering helps developers understand complex systems by providing them with high-level abstract (clustered)views of the software structure. The algorithms used by Bunch are computationally intensive and, hence, we would like to improve our tool's performance in order to cluster very large systems. This paper describes how we designed and implemented distributed version of Bunch, which is useful for clustering large systems.