Leftmost-one finding on meshes with segmented row buses
โ Scribed by Kuo-Liang Chung; Yu-Chih Lin
- Book ID
- 107920015
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 366 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0167-8655
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Routing with locality is studied for meshes with buses. In this problem, packets' distances are bounded by a value, d, which is less than the diameter of the network. This problem arises naturally when specific known algorithms are implemented on meshes. Solving this problem in ordinary meshes requi
Routing problems on the \(r\)-dimensional \(n \times n \times \cdots \times n\) mesh architecture, enhanced with independent buses along each dimension, are investigated. We analyze several different kinds of routing problems, among them off-line routing, and provide routing algorithms for the one-d