Using automatic process clustering for design recovery and distributed debugging
- 1 June 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 21 (6) , 515-527
- https://doi.org/10.1109/32.391378
Abstract
Distributed applications written in Hermes typically consist of a large number of sequential processes. The use of a hierarchy of process clusters can facilitate the debugging of such applications. Ideally, such a hierarchy should be derived automatically. This paper discusses two approaches to automatic process clustering, one analyzing runtime information with a statistical approach and one utilizing additional semantic information. Tools realizing these approaches were developed and a quantitative measure to evaluate process clusters is proposed. The results obtained under both approaches are compared, and indicate that the additional semantic information improves the cluster hierarchies derived. We demonstrate the value of automatic process clustering with an example. It is shown how appropriate process clusters reduce the complexity of the understanding process, facilitating program maintenance activities such as debugging.Keywords
This publication has 24 references indexed in Scilit:
- An intelligent tool for re-engineering software modularityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Process clustering for distributed debuggingPublished by Association for Computing Machinery (ACM) ,1993
- Operational versus definitional: a perspective on programming paradigmsComputer, 1992
- A measure for composite module cohesionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Ada task taxonomy support for concurrent programmingACM SIGSOFT Software Engineering Notes, 1991
- The C information abstraction systemIEEE Transactions on Software Engineering, 1990
- How to write parallel programs: a guide to the perplexedACM Computing Surveys, 1989
- Cluster AnalysisPublished by SAGE Publications ,1984
- An Algorithm for Partitioning the Nodes of a GraphSIAM Journal on Algebraic Discrete Methods, 1982
- The paradigms of programmingCommunications of the ACM, 1979