| 摘要 |
A solution ( 400 ) for discovering shared software components (C<SUB>1</SUB>-C<SUB>9</SUB>) of software products (PROD<SUB>a</SUB>-PROD<SUB>e</SUB>) installed on a data processing system ( 110 ) is proposed. In order to achieve this result, for each software product the corresponding software components are aggregated into groups (G<SUB>a1</SUB>-G<SUB>e1</SUB>); each group includes software components that must be linked by a corresponding relationship (such as a co-location on the same operating system image). In this way, it is possible to assign a software component available on the system to its software product even when it may be used by more of them. Particularly, the operation is performed deterministically when the available software component is included in a single valid group (i.e., a group including all the required software components); in this case, the available software component (C<SUB>2</SUB>) is assigned to the software product (PROD<SUB>b</SUB>) associated with the single valid group (G<SUB>b1</SUB>). Alternatively, when an (ambiguous) available software component (C<SUB>4</SUB>,C<SUB>8</SUB>,C<SUB>9</SUB>) is included in more valid groups, a score is calculated for each associated (eligible) software product according to the corresponding available software components; the eligible software product with the highest score (PROD<SUB>c</SUB>) is then selected for assigning the ambiguous software component.
|
