A study of mapping of locally message exchanging algorithms on a loosely-coupled multiprocessor:
Abstract: "Good load balance is the key to get the most from the processing power of parallel computers. Dynamic load balancing techniques have been developed and proved successful for tightly-coupled multiprocessors, and for loosely-coupled multiprocessors when the problem is composed of indep...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Tokyo, Japan
1990
|
| Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
587 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Good load balance is the key to get the most from the processing power of parallel computers. Dynamic load balancing techniques have been developed and proved successful for tightly-coupled multiprocessors, and for loosely-coupled multiprocessors when the problem is composed of independent tasks with large granularity. But the problem of mapping intercommunicating processes on loosely-coupled multiprocessors has not been well explored. In this paper, we consider the problem when there is locality in message communication (locally message exchanging algorithms) As an example, we developed a distributed algorithm for a single- source shortest path problem and tested three different static mappings of a large grid graph onto a mesh-connected multiprocessor, Multi-PSI. Two of them resulted in relatively good performance, and were shown to be a good compromise between communication localization and load balance. |
| Beschreibung: | 18 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010950108 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960916s1990 |||| 00||| engod | ||
| 035 | |a (OCoLC)25180489 | ||
| 035 | |a (DE-599)BVBBV010950108 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Wada, Kumiko |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A study of mapping of locally message exchanging algorithms on a loosely-coupled multiprocessor |c by K. Wada & N. Ichiyoshi |
| 264 | 1 | |a Tokyo, Japan |c 1990 | |
| 300 | |a 18 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 587 | |
| 520 | 3 | |a Abstract: "Good load balance is the key to get the most from the processing power of parallel computers. Dynamic load balancing techniques have been developed and proved successful for tightly-coupled multiprocessors, and for loosely-coupled multiprocessors when the problem is composed of independent tasks with large granularity. But the problem of mapping intercommunicating processes on loosely-coupled multiprocessors has not been well explored. In this paper, we consider the problem when there is locality in message communication (locally message exchanging algorithms) | |
| 520 | 3 | |a As an example, we developed a distributed algorithm for a single- source shortest path problem and tested three different static mappings of a large grid graph onto a mesh-connected multiprocessor, Multi-PSI. Two of them resulted in relatively good performance, and were shown to be a good compromise between communication localization and load balance. | |
| 650 | 4 | |a Mappings (Mathematics) | |
| 650 | 4 | |a Multiprocessors | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 700 | 1 | |a Ichiyoshi, Nobuyuki |e Verfasser |4 aut | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 587 |w (DE-604)BV010923438 |9 587 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007323948 | ||
Datensatz im Suchindex
| _version_ | 1804125437281959936 |
|---|---|
| any_adam_object | |
| author | Wada, Kumiko Ichiyoshi, Nobuyuki |
| author_facet | Wada, Kumiko Ichiyoshi, Nobuyuki |
| author_role | aut aut |
| author_sort | Wada, Kumiko |
| author_variant | k w kw n i ni |
| building | Verbundindex |
| bvnumber | BV010950108 |
| ctrlnum | (OCoLC)25180489 (DE-599)BVBBV010950108 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02072nam a2200337 cb4500</leader><controlfield tag="001">BV010950108</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960916s1990 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)25180489</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010950108</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Wada, Kumiko</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A study of mapping of locally message exchanging algorithms on a loosely-coupled multiprocessor</subfield><subfield code="c">by K. Wada & N. Ichiyoshi</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">18 S.</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">587</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Good load balance is the key to get the most from the processing power of parallel computers. Dynamic load balancing techniques have been developed and proved successful for tightly-coupled multiprocessors, and for loosely-coupled multiprocessors when the problem is composed of independent tasks with large granularity. But the problem of mapping intercommunicating processes on loosely-coupled multiprocessors has not been well explored. In this paper, we consider the problem when there is locality in message communication (locally message exchanging algorithms)</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">As an example, we developed a distributed algorithm for a single- source shortest path problem and tested three different static mappings of a large grid graph onto a mesh-connected multiprocessor, Multi-PSI. Two of them resulted in relatively good performance, and were shown to be a good compromise between communication localization and load balance.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mappings (Mathematics)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multiprocessors</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ichiyoshi, Nobuyuki</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">587</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">587</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007323948</subfield></datafield></record></collection> |
| id | DE-604.BV010950108 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:33Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007323948 |
| oclc_num | 25180489 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 18 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
| series2 | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
| spelling | Wada, Kumiko Verfasser aut A study of mapping of locally message exchanging algorithms on a loosely-coupled multiprocessor by K. Wada & N. Ichiyoshi Tokyo, Japan 1990 18 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 587 Abstract: "Good load balance is the key to get the most from the processing power of parallel computers. Dynamic load balancing techniques have been developed and proved successful for tightly-coupled multiprocessors, and for loosely-coupled multiprocessors when the problem is composed of independent tasks with large granularity. But the problem of mapping intercommunicating processes on loosely-coupled multiprocessors has not been well explored. In this paper, we consider the problem when there is locality in message communication (locally message exchanging algorithms) As an example, we developed a distributed algorithm for a single- source shortest path problem and tested three different static mappings of a large grid graph onto a mesh-connected multiprocessor, Multi-PSI. Two of them resulted in relatively good performance, and were shown to be a good compromise between communication localization and load balance. Mappings (Mathematics) Multiprocessors Parallel processing (Electronic computers) Ichiyoshi, Nobuyuki Verfasser aut Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 587 (DE-604)BV010923438 587 |
| spellingShingle | Wada, Kumiko Ichiyoshi, Nobuyuki A study of mapping of locally message exchanging algorithms on a loosely-coupled multiprocessor Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Mappings (Mathematics) Multiprocessors Parallel processing (Electronic computers) |
| title | A study of mapping of locally message exchanging algorithms on a loosely-coupled multiprocessor |
| title_auth | A study of mapping of locally message exchanging algorithms on a loosely-coupled multiprocessor |
| title_exact_search | A study of mapping of locally message exchanging algorithms on a loosely-coupled multiprocessor |
| title_full | A study of mapping of locally message exchanging algorithms on a loosely-coupled multiprocessor by K. Wada & N. Ichiyoshi |
| title_fullStr | A study of mapping of locally message exchanging algorithms on a loosely-coupled multiprocessor by K. Wada & N. Ichiyoshi |
| title_full_unstemmed | A study of mapping of locally message exchanging algorithms on a loosely-coupled multiprocessor by K. Wada & N. Ichiyoshi |
| title_short | A study of mapping of locally message exchanging algorithms on a loosely-coupled multiprocessor |
| title_sort | a study of mapping of locally message exchanging algorithms on a loosely coupled multiprocessor |
| topic | Mappings (Mathematics) Multiprocessors Parallel processing (Electronic computers) |
| topic_facet | Mappings (Mathematics) Multiprocessors Parallel processing (Electronic computers) |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT wadakumiko astudyofmappingoflocallymessageexchangingalgorithmsonalooselycoupledmultiprocessor AT ichiyoshinobuyuki astudyofmappingoflocallymessageexchangingalgorithmsonalooselycoupledmultiprocessor |