Load Balancing in Parallel Computers: Theory and PracticeSpringer, 2007. gada 26. aug. - 210 lappuses Load Balancing in Parallel Computers: Theory and Practice is about the essential software technique of load balancing in distributed memory message-passing parallel computers, also called multicomputers. Each processor has its own address space and has to communicate with other processors by message passing. In general, a direct, point-to-point interconnection network is used for the communications. Many commercial parallel computers are of this class, including the Intel Paragon, the Thinking Machine CM-5, and the IBM SP2. Load Balancing in Parallel Computers: Theory and Practice presents a comprehensive treatment of the subject using rigorous mathematical analyses and practical implementations. The focus is on nearest-neighbor load balancing methods in which every processor at every step is restricted to balancing its workload with its direct neighbours only. Nearest-neighbor methods are iterative in nature because a global balanced state can be reached through processors' successive local operations. Since nearest-neighbor methods have a relatively relaxed requirement for the spread of local load information across the system, they are flexible in terms of allowing one to control the balancing quality, effective for preserving communication locality, and can be easily scaled in parallel computers with a direct communication network. Load Balancing in Parallel Computers: Theory and Practice serves as an excellent reference source and may be used as a text for advanced courses on the subject. |
No grāmatas satura
1.5. rezultāts no 65.
xi. lappuse
... operations/second (teraflop) computers will soon be a reality and they will be ready to confront the most complex problems and the grandest challenges. A notable example is the project by the U.S. Department of Energy (DOE) on building ...
... operations/second (teraflop) computers will soon be a reality and they will be ready to confront the most complex problems and the grandest challenges. A notable example is the project by the U.S. Department of Energy (DOE) on building ...
xii. lappuse
... balancing its workload with its direct neighbors only. Nearestneighbor methods are iterative in nature because a global balanced state could be reached through processors' successive local operations. Since nearestneighbor methods have ...
... balancing its workload with its direct neighbors only. Nearestneighbor methods are iterative in nature because a global balanced state could be reached through processors' successive local operations. Since nearestneighbor methods have ...
xiii. lappuse
... operation does not necessarily lead to the fastest convergence rate in arriving at a global balanced state. We therefore generalize the dimension exchange method by introducing an exchange parameter into the method to control the ...
... operation does not necessarily lead to the fastest convergence rate in arriving at a global balanced state. We therefore generalize the dimension exchange method by introducing an exchange parameter into the method to control the ...
xiv. lappuse
... balancing procedure significantly. The second method, the diffusion method, is studied in Chapter 5 in a style similar to the study of the GDE method in the previous chapters. Chapter 6 compares the stability and efficiency of the GDE ...
... balancing procedure significantly. The second method, the diffusion method, is studied in Chapter 5 in a style similar to the study of the GDE method in the previous chapters. Chapter 6 compares the stability and efficiency of the GDE ...
2. lappuse
... operating system and supports a different set of programming languages and tools. Users of parallel machines not only need to write programs in unfamiliar and sometimes obscure parallel languages, but also need to tailor their programs ...
... operating system and supports a different set of programming languages and tools. Users of parallel machines not only need to write programs in unfamiliar and sometimes obscure parallel languages, but also need to tailor their programs ...
Saturs
| 1 | |
A SURVEY OF NEARESTNEIGHBOR LOAD BALANCING | 21 |
GDE ON TORIAND MESHES | 53 |
THE DIFFUSION METHOD | 79 |
TERMINATION DETECTION OF LOAD BALANCING | 121 |
REMAPPING WITH THE GDE METHOD | 136 |
CONCLUSIONS | 178 |
References | 187 |
13 | 188 |
Citi izdevumi - Skatīt visu
Load Balancing in Parallel Computers: Theory and Practice Chenzhong Xu,Francis C.M. Lau Ierobežota priekšskatīšana - 1996 |
Load Balancing in Parallel Computers Chenzhong Xu,Francis C. M. Lau Priekšskatījums nav pieejams - 2014 |
Load Balancing in Parallel Computers: Theory and Practice Chenzhong Xu,Francis C.M. Lau Priekšskatījums nav pieejams - 1997 |
Bieži izmantoti vārdi un frāzes
according analysis applications assume average bound branch-and-bound Chapter color combinatorial optimization communication communication model compared consider convergence rate cost counter denote dependent derived diffusion method diffusion parameter dimension exchange method direct domain dynamic edges efficiency eigenvalues equal example execution exists expected experiments factor Figure given global gossiping graph grid Hence idle implementation improvement initial iteration Lemma load balancing algorithms load balancing operation load distribution matrix memory mesh messages n-dimensional nearest-neighbor necessary neighbors nodes obtain optimal exchange parameter parallel computers partitioning path performance phase practical present problem procedure processor Proof random remapping respectively ring rule running shows simulation static step strategies structures subproblem sweeps synchronous Table takes termination detection Theorem thinning tion tori torus transfer various vertices workload workload distribution workload variance
Populāri fragmenti
36. lappuse - His heart in me keeps him and me in one, My heart in him his thoughts and senses guides: He loves my heart, for once it was his own, I cherish his because in me it bides...
198. lappuse - A survey of wormhole routing techniques in direct networks,
196. lappuse - FCH Lin and RM Keller. The Gradient Model Load Balancing Method.
200. lappuse - AB Sinha and LV Kale. A load balancing strategy for prioritized execution of tasks.
188. lappuse - JE Boillat. Load balancing and Poisson equation in a graph. Concurrency: Practice and Experience 2 (4) (1990) 289-311.
198. lappuse - Saltz. Dynamic Remapping of Parallel Computations with Varying Resource Demands.
189. lappuse - A Communicating Finite Automata Approach to Modeling Distributed Computation and its Application to Distributed Decision-Making," IEEE Transactions on Computers, May, 1990, pp.
195. lappuse - RE Kessler and JL Schwarzmeier, "CRAY T3D: A New Dimension for Cray Research,
188. lappuse - ... our tools, given more time. For example, SOS produced a variety of architectures for 2D-DCT that can be used to meet different design requirements. Our estimation tools, which were not used, will provide valuable information early for our tools when used in actual design situations. References [1] SH Bokhari. Assignment Problems in Parallel and Distributed Computing. Kluwer Academic Publishers, 1987. [2] CF Chang and BJ Sheu. A Multi-Chip Module Design for Portable Video Compression Systems....
Atsauces uz šo grāmatu
Bibliogrāfiskā informācija
| Nosaukums | Load Balancing in Parallel Computers: Theory and Practice Grāmatas The Springer International Series in Engineering and Computer Science 381. sējums. sējums |
| Autori | Chenzhong Xu, Francis C.M. Lau |
| Izdevums: | ilustrēts |
| Izdevējs | Springer, 2007 |
| ISBN | 0585272565, 9780585272566 |
| Apjoms | 210 lappuses |
| Eksportēt avotu | BiBTeX EndNote RefMan |