Methods for realizing a priority bus system
β Scribed by Koji Nakano; Toshimitsu Masuzawa; Nobuki Tokura
- Book ID
- 104591497
- Publisher
- John Wiley and Sons
- Year
- 1992
- Tongue
- English
- Weight
- 694 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0882-1666
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
Several bus models have been proposed for simultaneous messageβpassing on a bus. The priority model is a bus model in which the rightmost processor among processors trying to send to the bus actually succeeds and the common model is a bus model in which simultaneous sending is permitted only if the same value is sent by each processor. Obviously, the priority model is more powerful than the common model. We show two practical methods for realizing a priority bus using common buses.
π SIMILAR VOLUMES
An algorithm to obtain the minimum state-space realization of a linear multivariable system, based on its parametric input-output model, is presented. A special canonic form for the state-space representation is used, which guarantees the uniqueness of the derived relationships between this represen
We propose balancing related numerically reliable methods to compute minimal realizations of linear periodic systems with time-varying dimensions. The ΓΏrst method belongs to the family of square-root methods with guaranteed enhanced computational accuracy and can be used to compute balanced minimal