Parallel randomized search for distributed memory machines:
Gespeichert in:
| Beteiligte Personen: | , |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Tokyo, Japan
1991
|
| Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
696 |
| Schlagwörter: | |
| Abstract: | Abstract: "For the computation on parallel machines, each processor should be given even computational load. Generally speaking, there are two types of load balancing methods: dynamic ones and static ones. Static methods need the estimation of the task size and the communication cost, which is difficult in most cases. For Dynamic methods, communication problems should be resolved for efficient computing especialy [sic] on distributed memory machines. We give a different type of load balancing method for problems searching a single solution on distributed memory machines. That is a parallelization of randomized search Our method requires no communication during computation, and all processors are always busy. This parallelization on distributed memory machines is profitable for the problems which the above methods don't handle well. |
| Umfang: | 8 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010955859 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t| | ||
| 008 | 960918s1991 xx |||| 00||| engod | ||
| 035 | |a (OCoLC)26562378 | ||
| 035 | |a (DE-599)BVBBV010955859 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Iwayama, Noboru |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Parallel randomized search for distributed memory machines |c by N. Iwayama & K. Satoh |
| 264 | 1 | |a Tokyo, Japan |c 1991 | |
| 300 | |a 8 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 696 | |
| 520 | 3 | |a Abstract: "For the computation on parallel machines, each processor should be given even computational load. Generally speaking, there are two types of load balancing methods: dynamic ones and static ones. Static methods need the estimation of the task size and the communication cost, which is difficult in most cases. For Dynamic methods, communication problems should be resolved for efficient computing especialy [sic] on distributed memory machines. We give a different type of load balancing method for problems searching a single solution on distributed memory machines. That is a parallelization of randomized search | |
| 520 | 3 | |a Our method requires no communication during computation, and all processors are always busy. This parallelization on distributed memory machines is profitable for the problems which the above methods don't handle well. | |
| 650 | 4 | |a Multiprocessors | |
| 700 | 1 | |a Satoh, Ken |d 1959- |e Verfasser |0 (DE-588)134075757 |4 aut | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 696 |w (DE-604)BV010923438 |9 696 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-007328060 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0111 2001 B 6123-696 |
|---|---|
| DE-BY-TUM_katkey | 766082 |
| DE-BY-TUM_location | 01 |
| DE-BY-TUM_media_number | 040010306100 |
| _version_ | 1821938143854592000 |
| any_adam_object | |
| author | Iwayama, Noboru Satoh, Ken 1959- |
| author_GND | (DE-588)134075757 |
| author_facet | Iwayama, Noboru Satoh, Ken 1959- |
| author_role | aut aut |
| author_sort | Iwayama, Noboru |
| author_variant | n i ni k s ks |
| building | Verbundindex |
| bvnumber | BV010955859 |
| ctrlnum | (OCoLC)26562378 (DE-599)BVBBV010955859 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01864nam a2200313 cb4500</leader><controlfield tag="001">BV010955859</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">960918s1991 xx |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)26562378</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010955859</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">Iwayama, Noboru</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Parallel randomized search for distributed memory machines</subfield><subfield code="c">by N. Iwayama & K. Satoh</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">8 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">696</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "For the computation on parallel machines, each processor should be given even computational load. Generally speaking, there are two types of load balancing methods: dynamic ones and static ones. Static methods need the estimation of the task size and the communication cost, which is difficult in most cases. For Dynamic methods, communication problems should be resolved for efficient computing especialy [sic] on distributed memory machines. We give a different type of load balancing method for problems searching a single solution on distributed memory machines. That is a parallelization of randomized search</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Our method requires no communication during computation, and all processors are always busy. This parallelization on distributed memory machines is profitable for the problems which the above methods don't handle well.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multiprocessors</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Satoh, Ken</subfield><subfield code="d">1959-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)134075757</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">696</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">696</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007328060</subfield></datafield></record></collection> |
| id | DE-604.BV010955859 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T10:03:47Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007328060 |
| oclc_num | 26562378 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 8 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| 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 |
| spellingShingle | Iwayama, Noboru Satoh, Ken 1959- Parallel randomized search for distributed memory machines Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Multiprocessors |
| title | Parallel randomized search for distributed memory machines |
| title_auth | Parallel randomized search for distributed memory machines |
| title_exact_search | Parallel randomized search for distributed memory machines |
| title_full | Parallel randomized search for distributed memory machines by N. Iwayama & K. Satoh |
| title_fullStr | Parallel randomized search for distributed memory machines by N. Iwayama & K. Satoh |
| title_full_unstemmed | Parallel randomized search for distributed memory machines by N. Iwayama & K. Satoh |
| title_short | Parallel randomized search for distributed memory machines |
| title_sort | parallel randomized search for distributed memory machines |
| topic | Multiprocessors |
| topic_facet | Multiprocessors |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT iwayamanoboru parallelrandomizedsearchfordistributedmemorymachines AT satohken parallelrandomizedsearchfordistributedmemorymachines |
Paper/Kapitel scannen lassen
Teilbibliothek Mathematik & Informatik, Berichte
| Signatur: |
0111 2001 B 6123-696 Lageplan |
|---|---|
| Exemplar 1 | Ausleihbar Am Standort |