loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Working IEEE/IFIP Conference on Software Architecture (WISCA'01)
An Architecture for Distributing the Computation of Software Clustering Algorithms
Amsterdam, The Netherlands
August 28-August 31
ISBN: 0-7695-1360-3
Brian Mitchell, Drexel University
Martin raverso, Drexel University
Spiros Mancoridis, Drexel University
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.
Citation:
Brian Mitchell, Martin raverso, Spiros Mancoridis, "An Architecture for Distributing the Computation of Software Clustering Algorithms," wicsa, pp.181, Working IEEE/IFIP Conference on Software Architecture (WISCA'01), 2001
Usage of this product signifies your acceptance of the Terms of Use.