Inheritance Hierarchy Based Reuse & Reusability Metrics in OOSD
Journal Title: International Journal on Computer Science and Engineering - Year 2011, Vol 3, Issue 6
Abstract
Reuse and reusability are two major aspects in object oriented software which can be measured from inheritance hierarchy. Reusability is the prerequisite of reuse but both may or may not be measured using same metric. This paper characterizes metrics of reuse and reusability in Object Oriented Software Development (OOSD). Reuse metrics compute the extent to which classes have been reused and reusability metrics computes the extent to which classes can be reused. In this paper five new metrics namely- Breadth of Inheritance Tree (BIT), Method Reuse Per Inheritance Relation (MRPIR), Attribute Reuse Per Inheritance Relation (ARPIR), Generality of Class (GC) and Reuse Probability (RP) have been proposed. These metrics help to evaluate reuse and reusability of object oriented software. Four extensively validated existing object oriented metrics, namely- Depth of Inheritance Tree (DIT), Number of Children (NOC), Method Inheritance Factor (MIF) and Attribute Inheritance Factor (AIF) have been selected and investigated for comparison with proposed metrics. All metrics can be computed from inheritance hierarchies and classified according to their characteristics. Further, metrics are evaluated against a case study. These metrics are helpful in comparing alternative inheritance hierarchies at design time to select best alternative, so that the development time and cost can be reduced.
Authors and Affiliations
Nasib S. Gill , Sunil Sikka
Keywords
Related Articles
- EP ID EP113651
- DOI -
- Views 167
- Downloads 0
A Novel Density based improved k-means Clustering Algorithm – Dbkmeans
Abstract: Mining knowledge from large amounts of spatial data is known as spatial data mining. It becomes a highly demanding field because huge amounts of spatial data have been collected in various applications ranging...
Emerging Requirements Of Reconfigurable Computing Systems For Performance Enhancement
The reconfigurable computing is intended to fill the gap etween the non-flexible but high speed application specific integrated circuits based technology and the mostflexible but slow speed general purpose processor bas...
Performance Analysis of Lifetime Maximizing Trees for Data Aggregation in Wireless Sensor Networks
In this paper the performance of the proposed DLMT and CLMT algorithms are compared. These proposed algorithms tend to extend the node lifetime. Decentralized lifetime maximizing tree(DLMT) features in nodes with higher...
Automated Transformation of Distributed Software Architectural Models to Finite State Process
Software Performance Engineering (SPE) represents the collection of software engineering activities with the purpose of identification, prediction and also improvement of software performance parameters in the early stag...
A Novel Approach for clustering web user sessions using RST
Web usage mining has assumed importance in learning about web user's behavior and user interactions with the website. It uses data mining techniques to discover non-trivial user behavior patterns. These patterns can then...