The digital edition of all books may be viewed on our website before purchase. Excerpt from Synthesizing Linear-Array Algorithms From Nested for Loop Algorithms
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books.
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works. This text has been digitally restored from a historical edition. Some errors may persist, however we consider it worth publishing due to the work's historical value.The digital edition of all books may be viewed on our website before purchase.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : Forgotten Books, London, Royaume-Uni
Paperback. Etat : 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. N° de réf. du vendeur 9781334537820_0
Quantité disponible : Plus de 20 disponibles
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781334537820
Quantité disponible : 15 disponible(s)
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781334537820
Quantité disponible : 15 disponible(s)