Abstract
Dependency Resolution (DR) uses a component’s explicitly declared requirements and capabilities to calculate systems where all requirements are met. DR can lead to large amounts of possible solutions because multiple versions of the same component can be available and different vendors can offer the same functionality. From this set of potential solutions DR should identify and return the optimal solution.
Determining the feasibility of many optimisation techniques largely depends on the size and complexity of the DR solution search space. Using two sets of OSGi components collected from the Eclipse project and Spring Enterprise Bundle Repository, we measure the size and examine the complexity of the DR search space. By adding simple constraints based on desirable properties, we show the potentially large search space can be significantly restricted. This restriction could be used to make more complex optimisation algorithms feasible for DR.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Casey, J., Massol, V., Porter, B., Sanchez, C.: Better Builds with Maven (2008)
Berre, D.L., Rapicault, P.: Dependency Management for the Eclipse Ecosystem. In: IWOCE 2009 (2009)
Savolainen, J., Oliver, I., Myllarniemi, V., Mannisto, T.: Analyzing and Re-structuring Product Line Dependencies. In: Computer Software and Applications Conference, vol. 1, pp. 569–574. IEEE Computer Society Press, Los Alamitos (2007)
Berre, D.L., Parrain, A.: On SAT Technologies for dependency management and beyond. ASPL (2008)
Szyperski, C.: Component Software: Beyond Object-Oriented Programming, 2nd edn. The Component Software Series. Addison-Wesley Longman Publishing Co., Inc., Boston (2002)
David, P.C., Ledoux, T.: Towards a framework for self-adaptive component-based applications. Distributed Applications and Interoperable Systems, 1–14 (2003)
Plasil, F., Balek, D., Janecek, R.: SOFA/DCUP: architecture for component trading and dynamic updating. Configurable Distributed Systems, 43–51 (1998)
Berre, D.L., Parrain, A.: SAT4J at the SAT09 competitive events. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, Springer, Heidelberg (2009)
Ouimet, M., Lundqvist, K.: The TASM toolset: Specification, simulation, and formal verification of Real-Time systems. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 126–130. Springer, Heidelberg (2007)
Batory, D.: Feature models, grammars, and propositional formulas. Software Product Lines, 7–10 (2005)
Schaefer, T.J.: The complexity of satisfiability problems. In: STOC 1978: Proceedings of the tenth annual ACM symposium on Theory of computing, pp. 216–226. ACM, New York (1978)
The OSGi Alliance: OSGi Service Platform Core Specification (2007)
Kriens, P.: How OSGi changed my life. Queue 6(1), 44–51 (2008)
Becker, S., Koziolek, H., Reussner, R.: Model-Based performance prediction with the palladio component model. In: Proceedings of the 6th International Workshop on Software and performance, pp. 54–65. ACM Press, New York (2007)
Dietrich, J., Jenson, G.: Treaty - a modular component contract language. In: WCOP 2008 (2008)
Pierantonio, A., Zacchiroli, S., Ruscio, D.D., Pelliccione, P.: Metamodel for describing system structure and state (2009)
Abiteboul, S., Dar, I., Pop, R., Vasile, G., Vodislav, D., Preda, N.: Large scale P2P distribution of open-source software. In: VLDB 2007, VLDB Endowment Vienna, Austria, pp. 1390–1393. (2007)
Post, H., Sinz, C.: Configuration lifting: Verification meets software configuration. 23rd IEEE/ACM International Conference on Automated Software Engineering ASE 2008, 347–350 (2008)
Myllarniemi, V., Raatikainen, M., Mannisto, T.: Using a configurator for predictable component composition. In: 33rd EUROMICRO Conference on Software Engineering and Advanced Applications, pp. 47–58 (2007)
Sinz, C., Kaiser, A., Küchlin, W.: Formal methods for the validation of automotive product configuration data. Artif. Intell. Eng. Des. Anal. Manuf. 17(1), 75–97 (2003)
Aleti, A., Grunske, L., Meedeniya, I., Moser, I.: Let the ants deploy your software: an ACO based deployment optimisation strategy. In: ASE (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jenson, G., Dietrich, J., Guesgen, H.W. (2010). An Empirical Study of the Component Dependency Resolution Search Space. In: Grunske, L., Reussner, R., Plasil, F. (eds) Component-Based Software Engineering. CBSE 2010. Lecture Notes in Computer Science, vol 6092. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13238-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-13238-4_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13237-7
Online ISBN: 978-3-642-13238-4
eBook Packages: Computer ScienceComputer Science (R0)