Selecting highly optimal architectural feature sets with Filtered Cartesian Flattening

Journal of Systems and Software

Volumn 82, Issue 8, 2009, Pages 1268-1284

  White, Jules ^a   Dougherty, Brian ^a   Schmidt, Douglas C ^a  

^a VANDERBILT UNIVERSITY   (United States)

Author keywords

Approximation algorithm; Feature modeling; Optimization; Resource constraints

Indexed keywords

APPROXIMATION TECHNIQUES; ARCHITECTURAL FEATURES; CARTESIANS; COMPLEX CONFIGURATION; CONFIGURABLE; EMPIRICAL RESULTS; FEATURE MODELING; FEATURE MODELS; FEATURE SETS; OPTIMAL SETS; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; RESOURCE CONSTRAINT; RESOURCE CONSTRAINTS;

APPROXIMATION ALGORITHMS; ARCHITECTURE; FLOW MEASUREMENT; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

SET THEORY;

EID: 67949118803     PISSN: 01641212     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jss.2009.02.011     Document Type: Article

References (38)

1. Akbar, M., Manning, E., Shoja, G., Khan, S., 2001a. Heuristic solutions for the multiple-choice multi-dimension Knapsack problem. In: International Conference on Computational Science, pp. 659-668.
2. Akbar M., Manning E., Shoja G., and Khan S. Heuristic Solutions for the Multiple-Choice Multi-Dimension Knapsack Problem (2001), Springer (pp. 659-668)
3. Batory, D., 2005. Feature models, grammars, and prepositional formulas. In: Software Product Lines: 9th International Conference, SPLC 2005, Rennes, France, September 26-29, 2005: Proceedings.
4. Batory, D., Sarvela, J.N., Rauschmayer, A., 2003. Scaling step-wise refinement. In: International Conference on Software Engineering (ICSE-2003). Portland, OR, pp. 187-197.
5. Benavides, D., Segura, S., Trinidad, P., Ruiz-Cortés, A., 2007. FAMA: tooling a framework for the automated analysis of feature models. In: Proceeding of the First International Workshop on Variability Modelling of Software-intensive Systems (VAMOS).
6. Benavides, D., Trinidad, P., Ruiz-Cortés, A., 2005. Automated reasoning on feature models. In: 17th Conference on Advanced Information Systems Engineering (CAiSE05, Proceedings), LNCS 3520, pp. 491-503.
7. Capilla R., and Duenas J. Modelling variability with features in distributed architectures. Lecture Notes in Computer Science (2002) 319-329
8. Caprara A., Kellerer H., Pferschy U., and Pisinger D. Approximation algorithms for knapsack problems with cardinality constraints. European Journal of Operational Research 123 2 (2000) 333-345
9. Coffman, E., Garey, M., Johnson, D., 1996. Approximation algorithms for bin packing: a survey. Approximation algorithms for NP-hard problems table of contents, pp. 46-93.
10. Coplien J., Hoffman D., and Weiss D. Commonality and variability in software engineering. IEEE Software 15 November-December (1998) 37-45
11. Cormen T.H., Leiserson C.E., and Rivest R.L. Introduction to Algorithms (1990), MIT
12. Dudley, G., Joshi, N., Ogle, D., Subramanian, B., Topol, B., 2004. Autonomic self-healing systems in a cross-product IT environment. In: Proceedings of the International Conference on Autonomic Computing, pp. 312-313.
13. Etxeberria, L., Sagardui, G., 2008. Variability driven quality evaluation in software product lines. In: Software Product Line Conference, 2008. SPLC'08. 12th International, pp. 243-252.
14. Harel D. Statecharts: a visual formalism for complex systems. Science of Computer Programming 8 3 (1987) 231-274. URL:
15. Ibarra O., and Kim C. Fast approximation algorithms for the Knapsack and sum of subset problems. Journal of the ACM (JACM) 22 4 (1975) 463-468
16. Immonen, A., 2005. A method for predicting reliability and availability at the architectural level. In: Käkölä, T., Dueñas, J.C. (Eds.), Research Issues in Software Product-Lines-Engineering and Management.
17. Jarzabek, S., Yang, B., Yoeun, S., 2006. Addressing quality attributes in domain analysis for product lines. In: Software, IEE Proceedings, vol. 153, pp. 61-73.
18. Kang K.C., Kim S., Lee J., Kim K., Shin E., and Huh M. FORM: a feature-oriented reuse method with domain-specific reference architectures. Annals of Software Engineering 5 January (1998) 143-168
19. Kellerer H., and Pferschy U. A new fully polynomial time approximation scheme for the Knapsack problem. Journal of Combinatorial Optimization 3 1 (1999) 59-71
20. Lee K., and Kang K. Feature dependency analysis for product line component design. Lecture Notes in Computer Science (2004) 69-85
21. Lin S., and Kernighan B. An effective heuristic algorithm for the traveling salesman problem. Operations Research 21 2 (1973) 498-516
22. Lodi A., Martello S., and Vigo D. Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS Journal on Computing 11 4 (1999) 345-357
23. Mannion, M., 2002. Using first-order logic for product line model validation. In: Proceedings of the Second International Conference on Software Product Lines, vol. 2379, pp. 176-187.
24. Metzger, A., Pohl, K., Heymans, P., Schobbens, P.-Y., Saval, G., 2007. Disambiguating the documentation of variability in software product lines: a separation of concerns, formalization and automated analysis. In: Requirements Engineering Conference, 2007. RE'07, 15th IEEE International, pp. 243-253. .
25. Moser M., Jokanovic D., and Shiratori N. An algorithm for the multidimensional multiple-choice Knapsack problem. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 80 3 (1997) 582-589
26. MostofaAkbar M., SohelRahman M., Kaykobad M., Manning E., and Shoja G. Solving the multidimensional multiple-choice Knapsack problem by constructing convex hulls. Computers and Operations Research 33 5 (2006) 1259-1273
27. Niemelä E., and Immonen A. Capturing quality requirements of product family architecture. Information and Software Technology 49 11-12 (2007) 1107-1120
28. Olumofin, F., Misic, V., 2005. Extending the ATAM architecture evaluation to product line architectures. In: IEEE/IFIP Working Conference on Software Architecture, WICSA.
29. Parker J., and Parker J. Algorithms for Image Processing and Computer Vision (1996), John Wiley & Sons, Inc, New York, NY, USA
30. Phillips, P., Moon, H., Rizvi, S., Rauss, P., 2000. The FERET Evaluation Methodology for Face-Recognition Algorithms.
31. Pisinger D. A minimal algorithm for the multiple-choice Knapsack problem. European Journal of Operational Research 83 2 (1995) 394-410
32. Sinha P., and Zoltners A. The multiple-choice Knapsack problem. Operations Research 27 3 (1979) 503-515
33. Sinnema M., Deelstra S., Nijhuis J., and Bosch J. COVAMOF: a framework for modeling variability in software product families. Lecture Notes in Computer Science (2004) 197-213
34. White, J., Czarnecki, K., Schmidt, D.C., Lenz, G., Wienands, C., Wuchner, E., Fiege, L., 2007a. Automated model-based configuration of enterprise Java applications. In: The Enterprise Computing Conference, EDOC, Annapolis, Maryland, USA.
35. White, J., Nechypurenko, A., Wuchner, E., Schmidt, D.C., 2007b. Automating product-line variant selection for mobile devices. In: Proceedings of the 11th Annual Software Product Line Conference (SPLC), Kyoto, Japan.
36. White, J., Schmidt, D.C., 2006. Reducing enterprise product line architecture deployment costs via model-driven deployment and configuration testing. In: 13th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems.
37. White, J., Schmidt, D.C., Benavides, D., Trinidad, P., Ruiz-Cortez, A., 2008. Automated diagnosis of product-line configuration errors in feature models, pp. 659-668.
38. Zhang H., Jarzabek S., and Yang B. Quality prediction and assessment for product lines. Lecture Notes in Computer Science (2003) 681-695