DocumentCode
2376312
Title
Predicting Subsystem Failures using Dependency Graph Complexities
Author
Zimmermann, Thomas ; Nagappan, Nachiappan
Author_Institution
Univ. of Calgary, Calgary
fYear
2007
fDate
5-9 Nov. 2007
Firstpage
227
Lastpage
236
Abstract
In any software project, developers need to be aware of existing dependencies and how they affect their system. We investigated the architecture and dependencies of Windows Server 2003 to show how to use the complexity of a subsystem´s dependency graph to predict the number of failures at statistically significant levels. Such estimations can help to allocate software quality resources to the parts of a product that need it most, and as early as possible.
Keywords
data flow graphs; failure analysis; operating systems (computers); program diagnostics; software architecture; software metrics; software quality; Windows Server 2003; dependency graph complexity; software architecture; software development; software project; software quality resource allocation; subsystem failure prediction; Computer architecture; Graph theory; Large-scale systems; Programming; Quality assurance; Reliability engineering; Resource management; Software quality; Software reliability; USA Councils;
fLanguage
English
Publisher
ieee
Conference_Titel
Software Reliability, 2007. ISSRE '07. The 18th IEEE International Symposium on
Conference_Location
Trollhattan
ISSN
1071-9458
Print_ISBN
978-0-7695-3024-6
Type
conf
DOI
10.1109/ISSRE.2007.19
Filename
4402214
Link To Document