Assessing architectural complexity
- 27 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
While it is widely agreed that architectural simplicity is a key factor to the success of large software systems, it is not obvious how to measure architectural complexity. Our approach to measuring complexity is based on observation that large systems with a regular substructure are simple to create and maintain, whereas even relatively small systems created in an ad hoc fashion quickly become unmaintainable. This paper describes a system, called IAPR, that aids in architectural exploration and measurement by attempting to match patterns to an architecture. To do this, IAPR implements a heuristic form of sub-graph isomorphisman NP-hard problemusing the Constraint Satisfaction paradigm to limit the complexity of the problem space.Keywords
This publication has 5 references indexed in Scilit:
- Industrial experience with design patternsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The program understanding problem: analysis and a heuristic approachPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Classifying architectural elements as a foundation for mechanism matchingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Scenario-based analysis of software architectureIEEE Software, 1996
- Software Structure Metrics Based on Information FlowIEEE Transactions on Software Engineering, 1981