資料來源: Google Book
Load balancing in parallel computers :theory and practice
- 作者: Xu, Chengzhong.
- 其他作者: Lau, Francis C. M.
- 出版: Boston : Kluwer Academic Publishers ©1997.
- 稽核項: 1 online resource (xv, 210 pages) :illustrations.
- 叢書名: The Kluwer international series in engineering and computer science ;SECS 381
- 標題: computerwetenschappen , computer networks , COMPUTERS , COMPUTERS Reference. , Computer Science. , Informatie- en communicatietechnologie (algemeen) , procesarchitectuur , Reference. , process architecture , COMPUTERS Machine Theory. , HardwareGeneral. , Data Processing. , Computer Literacy. , Parallel computers. , computernetwerken , computer sciences , COMPUTERS Computer Science. , Electronic books. , COMPUTERS Hardware -- General. , COMPUTERS Computer Literacy. , Information Technology. , Sistemas de computacao. , COMPUTERS Information Technology. , Machine Theory. , Information and Communication Technology (General) , Computer capacity Management. , COMPUTERS Data Processing. , Computer capacity , Management.
- ISBN: 0585272565 , 9780585272566
- ISBN: 079239819X , 9780792398196
- 試查全文@TNUA:
- 附註: Includes bibliographical references (pages 187-203) and index. 1. INTRODUCTION -- 2. A SURVEY OF NEAREST-NEIGHBOR LOAD BALANCING ALGORITHMS -- 3. THE GDE METHOD4 GDE ON TORI AND MESHES -- 5. THE DIFFUSION METHOD -- 6. GDE VERSUS DIFFUSION -- 7. TERMINATION DETECTION OF LOAD BALANCING -- 8. REMAPPING WITH THE GDE METHOD -- 9. LOAD DISTRIBUTION IN COMBINATORIAL OPTIMIZATIONS -- 10. CONCLUSIONS.
- 摘要: [This book] "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. [We present] 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. [This book] serves as an excellent reference source and may be used as a text for advanced courses on the subject."
- 電子資源: https://dbs.tnua.edu.tw/login?url=https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=39496
- 系統號: 005291245
- 資料類型: 電子書
- 讀者標籤: 需登入
- 引用網址: 複製連結
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.
來源: Google Book
來源: Google Book
評分