Synopsis
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.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Synthesizing Linear-Array Algorithms From Nested for...
Seller Image
Synthesizing Linear-Array Algorithms From Nested for Loop Algorithms
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 4 out of 5 stars
Paperback. Condition: 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. Seller Inventory # 9781334537820_0
Buy New
US$ 17.70
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Synthesizing LinearArray Algorithms From Nested for Loop Algorithms Classic Reprint
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781334537820
Stock Image
Synthesizing LinearArray Algorithms From Nested for Loop Algorithms Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781334537820
Buy New
US$ 28.21
US$ 4.38 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 15 available