Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Zväzok 1M. Kaufmann Publishers, 1992 - 831 strán (strany) This book uniquely combines networks and parallel algorithms offering a generally advanced audience a fundamental understanding of parallel computing technology. Featuring communication networks that form the architectural basis of almost all parallel computing, the author describes their capabilities, limitations, and use in solving specific algorithmic problems with a simple, intuitive style. |
Obsah
Assessing the Performance of the Algorithm | 7 |
Finite Difference Methods | 93 |
Network | 113 |
Autorské práva | |
14 zvyšných častí nezobrazených
Časté výrazy a frázy
1-pixel algorithm described algorithm for sorting Beneš network bisection width bit steps bound Bruijn graph butterfly cell circuit column complete binary tree components compute constant contains convex hull cycle delay denote described in Subsection dilation edge efficient embedding example Gaussian elimination ghost message greedy algorithm Hence high probability Hough transform hull hypercubic networks implemented input integer iteration label leaf Lemma log log log N steps matching matrix maximum maximum matching merge mesh of trees minimum-weight spanning tree multiplication N-cell linear array N-node hypercube node O(log O(log N output P₁ packet routing packets packets cross palindrome parallel algorithm particular perform permutation Phase pixel polynomial processor proof queue r-dimensional randomized algorithm recursive retiming rightmost rightward routing algorithm routing problem Section Show shown in Figure shuffle-exchange graph simulate slowdown solve spanning tree subpackets supernode system of equations systolic Theorem transitive closure two-dimensional array Ulog