Loading...

Approximation algorithms for software component selection problem

Haghpanah, N ; Sharif University of Technology | 2007

666 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/APSEC.2007.26
  3. Publisher: 2007
  4. Abstract:
  5. Today's software systems are more frequently composed from preexisting commercial or non-commercial components and connectors. These components provide complex and independent functionality and are engaged in complex interactions. Component-Based Software Engineering (CBSE) is concerned with composing, selecting and designing such components. As the popularity of this approach and hence number of commercially available software components grows, selecting a set of components to satisfy a set of requirements while minimizing cost is becoming more difficult. This problem necessitates the design of efficient algorithms to automate component selection for software developing organizations. We address this challenge through analysis of Component Selection, the NP-complete process of selecting a minimal cost set of components to satisfy a set of objectives. Due to the high order of computational complexity of this problem, we examine approximating solutions that make the component selection process practicable. We adapt a greedy approach and a genetic algorithm to approximate this problem. We examined the performance of studied algorithms on a set of selected ActiveX components. Comparing the results of these two algorithms with the choices made by a group of human experts shows that we obtain better results using these approximation algorithms. © 2007 IEEE
  6. Keywords:
  7. Algorithms ; Approximation theory ; Architectural design ; Computational complexity ; Computer software ; Computer software selection and evaluation ; Cost benefit analysis ; Evolutionary algorithms ; Genetic algorithms ; Nuclear propulsion ; Numerical methods ; Polynomial approximation ; Set theory ; Software design ; Software engineering ; Technology ; (algorithmic) complexity ; (e ,3e) process ; Active X ; Asia Pacific ; Commercial components ; Complex interactions ; Component selection (CS) ; Component-based software engineering (CBSE) ; Efficient algorithms ; High order ; Human experts ; Minimal costs ; NP Complete ; Software components ; Software developing organizations ; Software systems ; Approximation algorithms
  8. Source: 14th Asia Pacific Software Engineering Conference, ASPCE 2007, Nagoya, 4 December 2007 through 7 December 2007 ; January , 2007 , Pages 159-166 ; 15301362 (ISSN); 0769530575 (ISBN); 9780769530574 (ISBN)
  9. URL: https://ieeexplore.ieee.org/document/4425850