The digital edition of all books may be viewed on our website before purchase. Excerpt from Lower Bounds on Vlsi Implementations of Communication Networks: May 1981 (Classic Reprint)
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.
Vos droits au titre de la garantie légale : Chaque consommateur de l'UE bénéficie d'au moins deux ans de protection au titre de la garantie légale pour tout bien de consommation vendu dans l'UE. Voir plus
Vendeur : Forgotten Books, London, Royaume-Uni
Paperback. Etat : New. No Jacket. Print on Demand. Understanding how network structure shapes chip area and performanceThis book examines how communication networks can be implemented on VLSI chips. It explains how network topologies, such as permutation networks and concentrators, affect the physical area required and the achievable performance. The discussion covers both traditional circuit-switching networks and packet-switching approaches, with a focus on lower bounds that guide what is possible in practice.Two sections analyze how to model and measure network efficiency. One shows that certain networks require area growing with the square of the number of inputs and outputs, while others can achieve linear growth in lines and switches but still face area limits. The other section develops ideas about bisection width, routing, and bandwidth, linking them to realistic 3D and planar implementations. The material also connects these concepts to universal ultracomputers, where many processors coordinate by message exchange over the network.- Grasp common network families like n-permutation networks, n-superconcentrators, and n-hyperconcentrators, and how they relate to area bounds.- Learn how bisection width and bandwidth influence the minimal area of both packet-switching and circuit-switching networks.- See how 3D layout and recirculating networks change the scaling of area with respect to size and performance.- Understand how planning routing strategies, whether centralized or decentralized, affects network efficiency and lower bounds.Ideal for readers who want a practical, theory-grounded view of how network design impacts hardware size and performance in VLSI systems. 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 9781332091379_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-9781332091379
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-9781332091379
Quantité disponible : 15 disponible(s)