protected:acdc
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revisionLast revisionBoth sides next revision | ||
protected:acdc [2010/05/06 14:00] – bil | protected:acdc [2010/05/08 15:18] – mark | ||
---|---|---|---|
Line 16: | Line 16: | ||
====== Process Description ====== | ====== Process Description ====== | ||
- | ACDC creates clusters by detecting established | + | ACDC creates clusters by detecting established subsystem patterns in the given software system. Software entities that are not clustered this way are assigned to the subsystem that depends the most on them. |
====== Decomposition Properties ====== | ====== Decomposition Properties ====== | ||
Line 24: | Line 24: | ||
* Module name with large out-degree | * Module name with large out-degree | ||
* “Support” for the cluster that contains all utilities | * “Support” for the cluster that contains all utilities | ||
- | * Module name of [[subsystem patterns|dominator node]] | + | * Module name of dominator node |
- All utilities modules belong to one cluster | - All utilities modules belong to one cluster | ||
- | - A large number of clusters contain a [[subsystem patterns|dominator node]] | + | - A large number of clusters contain a dominator node |
====== Algorithm Restrictions ====== | ====== Algorithm Restrictions ====== | ||
Line 80: | Line 80: | ||
- | ===== Completion of clustering using Orphan Adoption ===== | + | ===== Orphan Adoption ===== |
- | In the previous phase, the skeleton of software decomposition was constructed. Some modules are left unassigned from the first phase. | + | |
- | The [[Orphan Algorithm]] attempts to assign all unassigned modules to some subsystems. The skeleton decomposition | + | In the previous phase, the skeleton |
====== Implementation ====== | ====== Implementation ====== |
protected/acdc.txt · Last modified: 2010/05/08 15:20 by mark