Relevance of network theory to models of distributed/parallel processing
โ Scribed by Tadao Murata
- Publisher
- Elsevier Science
- Year
- 1980
- Tongue
- English
- Weight
- 614 KB
- Volume
- 310
- Category
- Article
- ISSN
- 0016-0032
No coin nor oath required. For personal study only.
โฆ Synopsis
This paper is concerned with the applicability of network theory to those aspects of distributed/parallel processing that can be modeled by marked graphs. First, several examples are given to illustrate that a wide variety of computation schemes can be modeled by marked graphs. Subsequently, the following topics are discussed: application of KVL to fault detection and isolation, KCL and Tellegen's Theorem applied to marked graphs, and the relationship between the maximum (minimum) storage requirement and the minimum (maximum) power.
๐ SIMILAR VOLUMES
Mercury porosimeter experiments have been traditionally used to investigate the pore structure of oil bearing rocks, although interpretation based upon the oversimplified parallel-bundle model is inadequate to explain many practical aspects of oil recovery. A technique for stochastically assigning t
Run-to-run control of a plasma etch process for 8 inch diameter silicon wafers at Digital Semiconductor is determined by maintenance of targeted values of post-etch metrology variables. The post-etch quality variables are extremely sensitive to variation in the etch chamber conditions due to fluctua