Load Balancing in Parallel Computers: Theory and Practice
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...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Boston, MA
Springer US
1997
|
| Schriftenreihe: | The Springer International Series in Engineering and Computer Science
381 |
| Schlagworte: | |
| Online-Zugang: | BTU01 Volltext |
| Zusammenfassung: | 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 |
| Beschreibung: | 1 Online-Ressource (XV, 210 p) |
| ISBN: | 9780585272566 |
| DOI: | 10.1007/b102252 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV045187698 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 180912s1997 |||| o||u| ||||||eng d | ||
| 020 | |a 9780585272566 |9 978-0-585-27256-6 | ||
| 024 | 7 | |a 10.1007/b102252 |2 doi | |
| 035 | |a (ZDB-2-ENG)978-0-585-27256-6 | ||
| 035 | |a (OCoLC)1053811496 | ||
| 035 | |a (DE-599)BVBBV045187698 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-634 | ||
| 082 | 0 | |a 004.1 |2 23 | |
| 084 | |a ST 150 |0 (DE-625)143594: |2 rvk | ||
| 084 | |a ST 151 |0 (DE-625)143595: |2 rvk | ||
| 100 | 1 | |a Chengzhong, Xu |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Load Balancing in Parallel Computers |b Theory and Practice |c by Xu Chengzhong, Francis C. M. Lau |
| 264 | 1 | |a Boston, MA |b Springer US |c 1997 | |
| 300 | |a 1 Online-Ressource (XV, 210 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a The Springer International Series in Engineering and Computer Science |v 381 | |
| 520 | |a 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 | ||
| 650 | 4 | |a Computer Science | |
| 650 | 4 | |a Processor Architectures | |
| 650 | 4 | |a Computer Communication Networks | |
| 650 | 4 | |a Computer Science, general | |
| 650 | 4 | |a Computer science | |
| 650 | 4 | |a Microprocessors | |
| 650 | 4 | |a Computer communication systems | |
| 650 | 0 | 7 | |a Lastteilung |0 (DE-588)4323960-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |D s |
| 689 | 0 | 1 | |a Lastteilung |0 (DE-588)4323960-2 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Lau, Francis C. M. |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780792398196 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/b102252 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-2-ENG | ||
| 940 | 1 | |q ZDB-2-ENG_Archiv | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-030576876 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u https://doi.org/10.1007/b102252 |l BTU01 |p ZDB-2-ENG |q ZDB-2-ENG_Archiv |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804178880184975360 |
|---|---|
| any_adam_object | |
| author | Chengzhong, Xu Lau, Francis C. M. |
| author_facet | Chengzhong, Xu Lau, Francis C. M. |
| author_role | aut aut |
| author_sort | Chengzhong, Xu |
| author_variant | x c xc f c m l fcm fcml |
| building | Verbundindex |
| bvnumber | BV045187698 |
| classification_rvk | ST 150 ST 151 |
| collection | ZDB-2-ENG |
| ctrlnum | (ZDB-2-ENG)978-0-585-27256-6 (OCoLC)1053811496 (DE-599)BVBBV045187698 |
| dewey-full | 004.1 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.1 |
| dewey-search | 004.1 |
| dewey-sort | 14.1 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| doi_str_mv | 10.1007/b102252 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03589nmm a2200565zcb4500</leader><controlfield tag="001">BV045187698</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">180912s1997 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780585272566</subfield><subfield code="9">978-0-585-27256-6</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/b102252</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-ENG)978-0-585-27256-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1053811496</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV045187698</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.1</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 150</subfield><subfield code="0">(DE-625)143594:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 151</subfield><subfield code="0">(DE-625)143595:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chengzhong, Xu</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Load Balancing in Parallel Computers</subfield><subfield code="b">Theory and Practice</subfield><subfield code="c">by Xu Chengzhong, Francis C. M. Lau</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, MA</subfield><subfield code="b">Springer US</subfield><subfield code="c">1997</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XV, 210 p)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">The Springer International Series in Engineering and Computer Science</subfield><subfield code="v">381</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Processor Architectures</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Communication Networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Science, general</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Microprocessors</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer communication systems</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Lastteilung</subfield><subfield code="0">(DE-588)4323960-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Lastteilung</subfield><subfield code="0">(DE-588)4323960-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lau, Francis C. M.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780792398196</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/b102252</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-ENG</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-ENG_Archiv</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030576876</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/b102252</subfield><subfield code="l">BTU01</subfield><subfield code="p">ZDB-2-ENG</subfield><subfield code="q">ZDB-2-ENG_Archiv</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV045187698 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T08:11:00Z |
| institution | BVB |
| isbn | 9780585272566 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030576876 |
| oclc_num | 1053811496 |
| open_access_boolean | |
| owner | DE-634 |
| owner_facet | DE-634 |
| physical | 1 Online-Ressource (XV, 210 p) |
| psigel | ZDB-2-ENG ZDB-2-ENG_Archiv ZDB-2-ENG ZDB-2-ENG_Archiv |
| publishDate | 1997 |
| publishDateSearch | 1997 |
| publishDateSort | 1997 |
| publisher | Springer US |
| record_format | marc |
| series2 | The Springer International Series in Engineering and Computer Science |
| spelling | Chengzhong, Xu Verfasser aut Load Balancing in Parallel Computers Theory and Practice by Xu Chengzhong, Francis C. M. Lau Boston, MA Springer US 1997 1 Online-Ressource (XV, 210 p) txt rdacontent c rdamedia cr rdacarrier The Springer International Series in Engineering and Computer Science 381 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 Computer Science Processor Architectures Computer Communication Networks Computer Science, general Computer science Microprocessors Computer communication systems Lastteilung (DE-588)4323960-2 gnd rswk-swf Parallelverarbeitung (DE-588)4075860-6 gnd rswk-swf Parallelverarbeitung (DE-588)4075860-6 s Lastteilung (DE-588)4323960-2 s 1\p DE-604 Lau, Francis C. M. aut Erscheint auch als Druck-Ausgabe 9780792398196 https://doi.org/10.1007/b102252 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Chengzhong, Xu Lau, Francis C. M. Load Balancing in Parallel Computers Theory and Practice Computer Science Processor Architectures Computer Communication Networks Computer Science, general Computer science Microprocessors Computer communication systems Lastteilung (DE-588)4323960-2 gnd Parallelverarbeitung (DE-588)4075860-6 gnd |
| subject_GND | (DE-588)4323960-2 (DE-588)4075860-6 |
| title | Load Balancing in Parallel Computers Theory and Practice |
| title_auth | Load Balancing in Parallel Computers Theory and Practice |
| title_exact_search | Load Balancing in Parallel Computers Theory and Practice |
| title_full | Load Balancing in Parallel Computers Theory and Practice by Xu Chengzhong, Francis C. M. Lau |
| title_fullStr | Load Balancing in Parallel Computers Theory and Practice by Xu Chengzhong, Francis C. M. Lau |
| title_full_unstemmed | Load Balancing in Parallel Computers Theory and Practice by Xu Chengzhong, Francis C. M. Lau |
| title_short | Load Balancing in Parallel Computers |
| title_sort | load balancing in parallel computers theory and practice |
| title_sub | Theory and Practice |
| topic | Computer Science Processor Architectures Computer Communication Networks Computer Science, general Computer science Microprocessors Computer communication systems Lastteilung (DE-588)4323960-2 gnd Parallelverarbeitung (DE-588)4075860-6 gnd |
| topic_facet | Computer Science Processor Architectures Computer Communication Networks Computer Science, general Computer science Microprocessors Computer communication systems Lastteilung Parallelverarbeitung |
| url | https://doi.org/10.1007/b102252 |
| work_keys_str_mv | AT chengzhongxu loadbalancinginparallelcomputerstheoryandpractice AT laufranciscm loadbalancinginparallelcomputerstheoryandpractice |