System size dependency of minimum load-dispatching rate in parallel inference machines:
Abstract: "System size dependency of the minimum load-dispatching rate for dynamic load balancing in parallel inference machines is described, where system size is the number of processor nodes connected through a network and the minimum load-dispatching rate for load balancing is the lowest lo...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Tokyo, Japan
1988
|
Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
431 |
Schlagworte: | |
Zusammenfassung: | Abstract: "System size dependency of the minimum load-dispatching rate for dynamic load balancing in parallel inference machines is described, where system size is the number of processor nodes connected through a network and the minimum load-dispatching rate for load balancing is the lowest load-dispatching rate in which a certain level of utilization is maintained. Relationship between the minimum load-dispatching rate and system size is measured in two load-dispatching strategies based on the sender-initiate concept by simulation on the loosely-coupled multi-processor model. The minimum load-dispatching rate has sub-linear (increase more slowly than linear) dependency on the system size in smart-random and max-min strategies In high average utilization cases, it is approximately proportional to n in the former strategy and (n - 1) / n in the latter strategy, where n is the system size. By decreasing system size, the minimum load-dispatching rate cannot be reduced so much in max-min strategy, but can be reduced in smart-random strategy. The load dispatch may also be assessed from the point of view of communication processing ability. In smart-random strategy, task division techniques can adjust the minimum load-dispatching rate for load balancing to communication processing capacity. |
Beschreibung: | 18 S. graph. Darst. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV010946732 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 960912s1988 d||| |||| 00||| engod | ||
035 | |a (OCoLC)20839481 | ||
035 | |a (DE-599)BVBBV010946732 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-91G | ||
100 | 1 | |a Sugie, M. |e Verfasser |4 aut | |
245 | 1 | 0 | |a System size dependency of minimum load-dispatching rate in parallel inference machines |c by M. Sugie and N. Inoue |
264 | 1 | |a Tokyo, Japan |c 1988 | |
300 | |a 18 S. |b graph. Darst. | ||
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 431 | |
520 | 3 | |a Abstract: "System size dependency of the minimum load-dispatching rate for dynamic load balancing in parallel inference machines is described, where system size is the number of processor nodes connected through a network and the minimum load-dispatching rate for load balancing is the lowest load-dispatching rate in which a certain level of utilization is maintained. Relationship between the minimum load-dispatching rate and system size is measured in two load-dispatching strategies based on the sender-initiate concept by simulation on the loosely-coupled multi-processor model. The minimum load-dispatching rate has sub-linear (increase more slowly than linear) dependency on the system size in smart-random and max-min strategies | |
520 | 3 | |a In high average utilization cases, it is approximately proportional to n in the former strategy and (n - 1) / n in the latter strategy, where n is the system size. By decreasing system size, the minimum load-dispatching rate cannot be reduced so much in max-min strategy, but can be reduced in smart-random strategy. The load dispatch may also be assessed from the point of view of communication processing ability. In smart-random strategy, task division techniques can adjust the minimum load-dispatching rate for load balancing to communication processing capacity. | |
650 | 4 | |a Computer simulation | |
650 | 4 | |a Machine theory | |
650 | 4 | |a Parallel processing (Electronic computers) | |
700 | 1 | |a Inoue, N. |e Verfasser |4 aut | |
830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 431 |w (DE-604)BV010923438 |9 431 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-007321005 |
Datensatz im Suchindex
_version_ | 1804125433280593920 |
---|---|
any_adam_object | |
author | Sugie, M. Inoue, N. |
author_facet | Sugie, M. Inoue, N. |
author_role | aut aut |
author_sort | Sugie, M. |
author_variant | m s ms n i ni |
building | Verbundindex |
bvnumber | BV010946732 |
ctrlnum | (OCoLC)20839481 (DE-599)BVBBV010946732 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02431nam a2200337 cb4500</leader><controlfield tag="001">BV010946732</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960912s1988 d||| |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)20839481</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010946732</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">Sugie, M.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">System size dependency of minimum load-dispatching rate in parallel inference machines</subfield><subfield code="c">by M. Sugie and N. Inoue</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1988</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">18 S.</subfield><subfield code="b">graph. Darst.</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">431</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "System size dependency of the minimum load-dispatching rate for dynamic load balancing in parallel inference machines is described, where system size is the number of processor nodes connected through a network and the minimum load-dispatching rate for load balancing is the lowest load-dispatching rate in which a certain level of utilization is maintained. Relationship between the minimum load-dispatching rate and system size is measured in two load-dispatching strategies based on the sender-initiate concept by simulation on the loosely-coupled multi-processor model. The minimum load-dispatching rate has sub-linear (increase more slowly than linear) dependency on the system size in smart-random and max-min strategies</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">In high average utilization cases, it is approximately proportional to n in the former strategy and (n - 1) / n in the latter strategy, where n is the system size. By decreasing system size, the minimum load-dispatching rate cannot be reduced so much in max-min strategy, but can be reduced in smart-random strategy. The load dispatch may also be assessed from the point of view of communication processing ability. In smart-random strategy, task division techniques can adjust the minimum load-dispatching rate for load balancing to communication processing capacity.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer simulation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine theory</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">Inoue, N.</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">431</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">431</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007321005</subfield></datafield></record></collection> |
id | DE-604.BV010946732 |
illustrated | Illustrated |
indexdate | 2024-07-09T18:01:29Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007321005 |
oclc_num | 20839481 |
open_access_boolean | |
owner | DE-91G DE-BY-TUM |
owner_facet | DE-91G DE-BY-TUM |
physical | 18 S. graph. Darst. |
publishDate | 1988 |
publishDateSearch | 1988 |
publishDateSort | 1988 |
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 | Sugie, M. Verfasser aut System size dependency of minimum load-dispatching rate in parallel inference machines by M. Sugie and N. Inoue Tokyo, Japan 1988 18 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 431 Abstract: "System size dependency of the minimum load-dispatching rate for dynamic load balancing in parallel inference machines is described, where system size is the number of processor nodes connected through a network and the minimum load-dispatching rate for load balancing is the lowest load-dispatching rate in which a certain level of utilization is maintained. Relationship between the minimum load-dispatching rate and system size is measured in two load-dispatching strategies based on the sender-initiate concept by simulation on the loosely-coupled multi-processor model. The minimum load-dispatching rate has sub-linear (increase more slowly than linear) dependency on the system size in smart-random and max-min strategies In high average utilization cases, it is approximately proportional to n in the former strategy and (n - 1) / n in the latter strategy, where n is the system size. By decreasing system size, the minimum load-dispatching rate cannot be reduced so much in max-min strategy, but can be reduced in smart-random strategy. The load dispatch may also be assessed from the point of view of communication processing ability. In smart-random strategy, task division techniques can adjust the minimum load-dispatching rate for load balancing to communication processing capacity. Computer simulation Machine theory Parallel processing (Electronic computers) Inoue, N. Verfasser aut Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 431 (DE-604)BV010923438 431 |
spellingShingle | Sugie, M. Inoue, N. System size dependency of minimum load-dispatching rate in parallel inference machines Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Computer simulation Machine theory Parallel processing (Electronic computers) |
title | System size dependency of minimum load-dispatching rate in parallel inference machines |
title_auth | System size dependency of minimum load-dispatching rate in parallel inference machines |
title_exact_search | System size dependency of minimum load-dispatching rate in parallel inference machines |
title_full | System size dependency of minimum load-dispatching rate in parallel inference machines by M. Sugie and N. Inoue |
title_fullStr | System size dependency of minimum load-dispatching rate in parallel inference machines by M. Sugie and N. Inoue |
title_full_unstemmed | System size dependency of minimum load-dispatching rate in parallel inference machines by M. Sugie and N. Inoue |
title_short | System size dependency of minimum load-dispatching rate in parallel inference machines |
title_sort | system size dependency of minimum load dispatching rate in parallel inference machines |
topic | Computer simulation Machine theory Parallel processing (Electronic computers) |
topic_facet | Computer simulation Machine theory Parallel processing (Electronic computers) |
volume_link | (DE-604)BV010923438 |
work_keys_str_mv | AT sugiem systemsizedependencyofminimumloaddispatchingrateinparallelinferencemachines AT inouen systemsizedependencyofminimumloaddispatchingrateinparallelinferencemachines |