A scalable termination detection scheme using message combining:
Abstract: "We propose a scalable termination detection scheme for distributed computation on large-scale multicomputers. It is based on the Weighted Throw Counting technique (an application of the weighted reference counting for distributed incremental garbage collection), and employs software...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Tokyo, Japan
1992
|
| Series: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
736 |
| Subjects: | |
| Summary: | Abstract: "We propose a scalable termination detection scheme for distributed computation on large-scale multicomputers. It is based on the Weighted Throw Counting technique (an application of the weighted reference counting for distributed incremental garbage collection), and employs software message combining to remove the bottleneck at the detecting process. We introduce a delayed returning rule for combining an unpredictable number of messages at each internal node of the combining tree. In contrast to message complexity commonly used as an efficiency criterion of termination detection algorithms, the scheme is aimed at minimizing the time complexity of detection." |
| Physical Description: | 16 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010956651 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960919s1992 |||| 00||| engod | ||
| 035 | |a (OCoLC)27807779 | ||
| 035 | |a (DE-599)BVBBV010956651 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Ichiyoshi, Nobuyuki |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A scalable termination detection scheme using message combining |c N. Ichiyoshi & K. Rokusawa |
| 264 | 1 | |a Tokyo, Japan |c 1992 | |
| 300 | |a 16 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 736 | |
| 520 | 3 | |a Abstract: "We propose a scalable termination detection scheme for distributed computation on large-scale multicomputers. It is based on the Weighted Throw Counting technique (an application of the weighted reference counting for distributed incremental garbage collection), and employs software message combining to remove the bottleneck at the detecting process. We introduce a delayed returning rule for combining an unpredictable number of messages at each internal node of the combining tree. In contrast to message complexity commonly used as an efficiency criterion of termination detection algorithms, the scheme is aimed at minimizing the time complexity of detection." | |
| 650 | 4 | |a Parallel programming (Computer science) | |
| 700 | 1 | |a Rokusawa, Kazuaki |e Verfasser |4 aut | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 736 |w (DE-604)BV010923438 |9 736 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007328764 | ||
Record in the Search Index
| _version_ | 1804125443920494592 |
|---|---|
| any_adam_object | |
| author | Ichiyoshi, Nobuyuki Rokusawa, Kazuaki |
| author_facet | Ichiyoshi, Nobuyuki Rokusawa, Kazuaki |
| author_role | aut aut |
| author_sort | Ichiyoshi, Nobuyuki |
| author_variant | n i ni k r kr |
| building | Verbundindex |
| bvnumber | BV010956651 |
| ctrlnum | (OCoLC)27807779 (DE-599)BVBBV010956651 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01702nam a2200301 cb4500</leader><controlfield tag="001">BV010956651</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960919s1992 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27807779</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010956651</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">Ichiyoshi, Nobuyuki</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A scalable termination detection scheme using message combining</subfield><subfield code="c">N. Ichiyoshi & K. Rokusawa</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">16 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">736</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We propose a scalable termination detection scheme for distributed computation on large-scale multicomputers. It is based on the Weighted Throw Counting technique (an application of the weighted reference counting for distributed incremental garbage collection), and employs software message combining to remove the bottleneck at the detecting process. We introduce a delayed returning rule for combining an unpredictable number of messages at each internal node of the combining tree. In contrast to message complexity commonly used as an efficiency criterion of termination detection algorithms, the scheme is aimed at minimizing the time complexity of detection."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel programming (Computer science)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rokusawa, Kazuaki</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">736</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">736</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007328764</subfield></datafield></record></collection> |
| id | DE-604.BV010956651 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:39Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007328764 |
| oclc_num | 27807779 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 16 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| 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 | Ichiyoshi, Nobuyuki Verfasser aut A scalable termination detection scheme using message combining N. Ichiyoshi & K. Rokusawa Tokyo, Japan 1992 16 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 736 Abstract: "We propose a scalable termination detection scheme for distributed computation on large-scale multicomputers. It is based on the Weighted Throw Counting technique (an application of the weighted reference counting for distributed incremental garbage collection), and employs software message combining to remove the bottleneck at the detecting process. We introduce a delayed returning rule for combining an unpredictable number of messages at each internal node of the combining tree. In contrast to message complexity commonly used as an efficiency criterion of termination detection algorithms, the scheme is aimed at minimizing the time complexity of detection." Parallel programming (Computer science) Rokusawa, Kazuaki Verfasser aut Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 736 (DE-604)BV010923438 736 |
| spellingShingle | Ichiyoshi, Nobuyuki Rokusawa, Kazuaki A scalable termination detection scheme using message combining Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Parallel programming (Computer science) |
| title | A scalable termination detection scheme using message combining |
| title_auth | A scalable termination detection scheme using message combining |
| title_exact_search | A scalable termination detection scheme using message combining |
| title_full | A scalable termination detection scheme using message combining N. Ichiyoshi & K. Rokusawa |
| title_fullStr | A scalable termination detection scheme using message combining N. Ichiyoshi & K. Rokusawa |
| title_full_unstemmed | A scalable termination detection scheme using message combining N. Ichiyoshi & K. Rokusawa |
| title_short | A scalable termination detection scheme using message combining |
| title_sort | a scalable termination detection scheme using message combining |
| topic | Parallel programming (Computer science) |
| topic_facet | Parallel programming (Computer science) |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT ichiyoshinobuyuki ascalableterminationdetectionschemeusingmessagecombining AT rokusawakazuaki ascalableterminationdetectionschemeusingmessagecombining |