Calculus of space-optimal mappings of systolic algorithms on processor arrays
✍ Scribed by Clauss, Philippe ;Mongenet, Catherine ;Perrin, Guy-rené
- Publisher
- Springer
- Year
- 1992
- Tongue
- English
- Weight
- 860 KB
- Volume
- 4
- Category
- Article
- ISSN
- 0922-5773
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Chen, G.-H. and M.-S. Chern, Synthesis of algorithms on processor arrays, Parallel Computing 17 (1991) ## 279-284 The data dependence graph is very useful to parallel algorithm design. In this paper, approaches are introduced to map two classes of data dependence graphs, the regular graphs and th
Algorithms for many geometric and physical algorithms rely on a decomposition of 3-D space. Typically, a cubical decomposition is used, where each cubical cell is adjacent to, and may interact with, as many as 26 neighboring cells. In this paper, we explore an alternate structure, the woven mesh, th
Step 2: combination for elimination of the a i,k 's for Therefore the algorithm is the following (the a k,k 's are supposed nonzero