Abstract
Purchase PDF (75 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (0)
Purchase PDF (531 K)
doi:10.1016/0164-1212(86)90027-0 
Copyright © 1986 Published by Elsevier Science Inc.
Classification algorithms
Available online 26 June 2003.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
In the field of performance evaluation of computer systems is a very promising technique: decomposability theory. It is a special approach of the solution of complex systems in three steps:
- 1. (1) Decomposition of the system into subsystems that can be studied in detail, modelized, and solved, assuming that they are not very much dependent on the other subsystems.
- 2. (2) Analysis of the relations between the subsystems, and solution of the global system, by replacing each of the subsystems with an equivalent one deduced from the first-step study.
- 3. (3) Validation by simulation, in order to derive the precision of the results. This technique is based on the concept of near-complete decomposability and uses variable aggregations.
