Synthesizing linear array algorithms nested di lee peizong (1 risultati)
- Altre immagini
- Brossura
- Print on Demand
Da: Forgotten Books, London, Regno UnitoForgotten Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 16,02
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Paperback. Condizione: New. Print on Demand. This book explores a systematic method for designing and analyzing linear-array algorithms, which are efficiently implemented using systolic arrays. Systolic arrays are integrated circuits containing many simple processors arranged in a regular pattern with localized interconnections.… The author presents a method for mapping nested loop algorithms into linear arrays, and demonstrates necessary and sufficient conditions for correct mappings. The conditions encompass several different aspects of the design, including data dependency constraints, preservation of nonsingularity of the mapping, prevention of data contention, and simplicity of processor hardware. Using this methodology, the author investigates linear array implementations of several algorithms, including matrix multiplication, L-U decomposition, and a version of the transitive closure algorithm. Furthermore, they analyze time and storage complexity of linear array implementations, and provide tight bounds on the time complexity of linear array implementations for particular algorithms. This book will be of interest to researchers in computer science and engineering, as well as to practitioners interested in the design and analysis of systolic arrays. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.
