Sorry, the book that you are looking for is not available right now.
We did a search for other books with a similar title, and found some results for you that may be helpful.
Matrix Computations on Systolic-Type Arrays provides a framework which permits a good understanding of the features and limitations of processor arrays for matrix algorithms. It describes the tradeoffs among the characteristics of these systems, such as internal storage and communication bandwidth, and the impact on overall performance and cost. A system which allows for the analysis of methods for the design/mapping of matrix algorithms is also presented. This method identifies stages in the design/mapping process and the capabilities required at each stage. Matrix Computations on Systolic-Type Arrays provides a much needed description of the area of processor arrays for matrix algorithms and of the methods used to derive those arrays. The ideas developed here reduce the space of solutions in the design/mapping process by establishing clear criteria to select among possible options as well as by a-priori rejection of alternatives which are not adequate (but which are considered in other approaches). The end result is a method which is more specific than other techniques previously available (suitable for a class of matrix algorithms) but which is more systematic, better defined and more effective in reaching the desired objectives. Matrix Computations on Systolic-Type Arrays will interest researchers and professionals who are looking for systematic mechanisms to implement matrix algorithms either as algorithm-specific structures or using specialized architectures. It provides tools that simplify the design/mapping process without introducing degradation, and that permit tradeoffs between performance/cost measures selected by the designer.
|Systolic-type arrays for matrix algorithms||p. 15|
|Regularization of matrix algorithms||p. 45|
|Realization of algorithm-specific fixed-size arrays||p. 91|
|Partitioned realizations using cut-and-pile||p. 135|
|Partitioned realizations using coalescing||p. 171|
|Linear pseudosystolic array for matrix algorithms||p. 199|
|Mapping matrix algorithms||p. 225|
|Summary and further research||p. 259|
|Table of Contents provided by Blackwell. All Rights Reserved.|
Series: The Springer International Series in Engineering and Computer Science
Number Of Pages: 280
Published: 31st October 1992
Publisher: Kluwer Academic Publishers
Dimensions (cm): 23.5 x 15.5 x 1.9
Weight (kg): 0.62