Introduction to Parallel Algorithms and Architectures: Arrays · Trees · Hypercubes
Elsevier, 12. 5. 2014 - 852 strán (strany)
Introduction to Parallel Algorithms and Architectures: Arrays Trees Hypercubes provides an introduction to the expanding field of parallel algorithms and architectures. This book focuses on parallel computation involving the most popular network architectures, namely, arrays, trees, hypercubes, and some closely related networks.
Organized into three chapters, this book begins with an overview of the simplest architectures of arrays and trees. This text then presents the structures and relationships between the dominant network architectures, as well as the most efficient parallel algorithms for a wide variety of problems. Other chapters focus on fundamental results and techniques and on rigorous analysis of algorithmic performance. This book discusses as well a hybrid of network architecture based on arrays and trees called the mesh of trees. The final chapter deals with the most important properties of hypercubes.
This book is a valuable resource for readers with a general technical background.
Čo hovoria ostatní - Napísať recenziu
Na obvyklých miestach sme nenašli žiadne recenzie.
Iné vydania - Zobraziť všetky
1-pixel algorithm described algorithm for sorting Beneš network bisection width bit position bit steps bound Bruijn graph butterfly cell circuit complete binary tree components compute congestion contains defined delay denote described in Subsection dilation dimension edges efficient embedding example Gaussian elimination ghost message greedy algorithm Hamiltonian cycle Hence high probability hypercubic networks implemented information dispersal algorithm input integer label leaf Lemma linear array log log log N steps log N-dimensional butterfly matrix maximum matching merge merge algorithm Merge Sort mesh of trees multiplication N-node hypercube O(log N O(VN odd-even one-to-one output packet routing packets parallel algorithm particular path perform permutation Phase pixel polynomial prefix processor proof queue r-dimensional random routing randomized algorithm recursive result retiming routing algorithm routing problem Section Show significant bit simulate slowdown solve subnetwork subpackets supernode system of equations systolic Theorem transitive closure two-dimensional ulog VN x VN wrapped butterfly