Learn how regular networks are partitioned under size and perimeter limits, and what that means for real systems.
This technical report examines partitions of regular interconnection networks and how the number of components depends on the connections between them. It connects abstract graph properties to practical questions about data movement in networks such as grids, trees, and shuffle‑exchange graphs. The work also relates partitionability to the ability to support efficient routing, highlighting how networks optimized for routing may partition differently.
Readers will gain a clear view of the relationships between area (component size) and perimeter (external connections), along with concrete bounds and constructions. The discussion covers definitions of partitions, mesh‑connected networks, regular trees, and specific network families, tying theory to architectural constraints in multichip systems and VLSI layouts.
Ideal for readers of On the Partitioning of Regular Networks, as well as professionals exploring parallel processing, network design, and VLSI constraints.
"synopsis" may belong to another edition of this title.
Snir is Senior Manager, Scalable Parallel Systems, IBM Research Division.
"About this title" may belong to another edition of this title.
Seller: Forgotten Books, London, United Kingdom
Paperback. Condition: New. No Jacket. Print on Demand. Hook line: Learn how regular networks are partitioned under size and perimeter limits, and what that means for real systems.This technical report examines partitions of regular interconnection networks and how the number of components depends on the connections between them. It connects abstract graph properties to practical questions about data movement in networks such as grids, trees, and shuffle?exchange graphs. The work also relates partitionability to the ability to support efficient routing, highlighting how networks optimized for routing may partition differently.Readers will gain a clear view of the relationships between area (component size) and perimeter (external connections), along with concrete bounds and constructions. The discussion covers definitions of partitions, mesh?connected networks, regular trees, and specific network families, tying theory to architectural constraints in multichip systems and VLSI layouts. Definitions of (s, p)-partitions and how they constrain component size and boundary edges. Bounds on the maximal component size and minimal partitions in 2D and higher?dimensional mesh networks. Applications to grids, shuffle?exchange, and related networks, with implications for data motion and routing. Connections between partitionability and the efficiency of data permutations and network designs.Ideal for readers of On the Partitioning of Regular Networks, as well as professionals exploring parallel processing, network design, and VLSI constraints. 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 # 9781333311230_0
Quantity: Over 20 available
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781333311230
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781333311230
Quantity: 15 available