On time and space decomposition of complex structures
- 1 June 1985
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 28 (6) , 590-603
- https://doi.org/10.1145/3812.3814
Abstract
Models of large and complex systems can often be reduced to smaller sub-models, for easier analysis, by a process known as decomposition. Certain criteria for successful decompositions can be established.Keywords
This publication has 16 references indexed in Scilit:
- On polyhedra of Perron-Frobenius eigenvectorsLinear Algebra and its Applications, 1985
- Bounds for the Positive Eigenvectors of Nonnegative Matrices and for their Approximations by DecompositionJournal of the ACM, 1984
- Structure and complexity in economic and social systemsMathematical Social Sciences, 1983
- Approximate Analysis of General Queuing Networks by DecompositionIEEE Transactions on Communications, 1979
- Application de l'ordre par fluctuations a la description de certaines étapes de la construction du nid chez les TermitesInsectes Sociaux, 1977
- Decomposability, instabilities, and saturation in multiprogramming systemsCommunications of the ACM, 1975
- Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJournal of the ACM, 1975
- Packet Switching in a Multiaccess Broadcast Channel: Performance EvaluationIEEE Transactions on Communications, 1975
- On the criteria to be used in decomposing systems into modulesCommunications of the ACM, 1972
- The structure of the “THE”-multiprogramming systemCommunications of the ACM, 1968