A detection algorithm of perpetual suspension in KL1:
Abstract: "KL1 is a committed-choice language, designed as the kernel language of the parallel inference machines which are under development in the Japanese fifth generation project. It is known that committed-choice languages are suitable to describe the concurrent processes because synchroni...
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
530 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "KL1 is a committed-choice language, designed as the kernel language of the parallel inference machines which are under development in the Japanese fifth generation project. It is known that committed-choice languages are suitable to describe the concurrent processes because synchronization is supported as a language primitive. A producer/consumer model, in which a producer and a consumer cooperate using data-flow synchronization, is a typical programming style of these languages. However, one thing we must treat carefully is that the execution can fall into the state of perpetual suspension because of some mistakes in the programs, in the case of such data-flow computation. Fixing such mistakes would be very difficult if it were not for the implementation supports Therefore, as a practical tool for the software development, it is extremely important to detect an occurrence of such an illegal state and to notify it to users. This paper presents an algorithm to detect an occurrenceof perpetual suspension and to report the maximal goals from the causality graph of perpetual suspension. The algorithm takes advantage of the characteristics of copying garbage collection scheme, and have already been implemented on the Multi-PSI, a prototype of the parallel inference machines. |
| Beschreibung: | 16 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010949561 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960916s1990 |||| 00||| engod | ||
| 035 | |a (OCoLC)22495628 | ||
| 035 | |a (DE-599)BVBBV010949561 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Inamura, Yu |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A detection algorithm of perpetual suspension in KL1 |c by Y. Inamura & S. Onishi |
| 264 | 1 | |a Tokyo, Japan |c 1990 | |
| 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 530 | |
| 520 | 3 | |a Abstract: "KL1 is a committed-choice language, designed as the kernel language of the parallel inference machines which are under development in the Japanese fifth generation project. It is known that committed-choice languages are suitable to describe the concurrent processes because synchronization is supported as a language primitive. A producer/consumer model, in which a producer and a consumer cooperate using data-flow synchronization, is a typical programming style of these languages. However, one thing we must treat carefully is that the execution can fall into the state of perpetual suspension because of some mistakes in the programs, in the case of such data-flow computation. Fixing such mistakes would be very difficult if it were not for the implementation supports | |
| 520 | 3 | |a Therefore, as a practical tool for the software development, it is extremely important to detect an occurrence of such an illegal state and to notify it to users. This paper presents an algorithm to detect an occurrenceof perpetual suspension and to report the maximal goals from the causality graph of perpetual suspension. The algorithm takes advantage of the characteristics of copying garbage collection scheme, and have already been implemented on the Multi-PSI, a prototype of the parallel inference machines. | |
| 650 | 4 | |a KL1 (Computer program language) | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 700 | 1 | |a Onishi, Satoshi |e Verfasser |4 aut | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 530 |w (DE-604)BV010923438 |9 530 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007323457 | ||
Datensatz im Suchindex
| _version_ | 1804125436571025408 |
|---|---|
| any_adam_object | |
| author | Inamura, Yu Onishi, Satoshi |
| author_facet | Inamura, Yu Onishi, Satoshi |
| author_role | aut aut |
| author_sort | Inamura, Yu |
| author_variant | y i yi s o so |
| building | Verbundindex |
| bvnumber | BV010949561 |
| ctrlnum | (OCoLC)22495628 (DE-599)BVBBV010949561 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02371nam a2200325 cb4500</leader><controlfield tag="001">BV010949561</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)22495628</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010949561</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">Inamura, Yu</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A detection algorithm of perpetual suspension in KL1</subfield><subfield code="c">by Y. Inamura & S. Onishi</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">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">530</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "KL1 is a committed-choice language, designed as the kernel language of the parallel inference machines which are under development in the Japanese fifth generation project. It is known that committed-choice languages are suitable to describe the concurrent processes because synchronization is supported as a language primitive. A producer/consumer model, in which a producer and a consumer cooperate using data-flow synchronization, is a typical programming style of these languages. However, one thing we must treat carefully is that the execution can fall into the state of perpetual suspension because of some mistakes in the programs, in the case of such data-flow computation. Fixing such mistakes would be very difficult if it were not for the implementation supports</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Therefore, as a practical tool for the software development, it is extremely important to detect an occurrence of such an illegal state and to notify it to users. This paper presents an algorithm to detect an occurrenceof perpetual suspension and to report the maximal goals from the causality graph of perpetual suspension. The algorithm takes advantage of the characteristics of copying garbage collection scheme, and have already been implemented on the Multi-PSI, a prototype of the parallel inference machines.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">KL1 (Computer program language)</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">Onishi, Satoshi</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">530</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">530</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007323457</subfield></datafield></record></collection> |
| id | DE-604.BV010949561 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:32Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007323457 |
| oclc_num | 22495628 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 16 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 | Inamura, Yu Verfasser aut A detection algorithm of perpetual suspension in KL1 by Y. Inamura & S. Onishi Tokyo, Japan 1990 16 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 530 Abstract: "KL1 is a committed-choice language, designed as the kernel language of the parallel inference machines which are under development in the Japanese fifth generation project. It is known that committed-choice languages are suitable to describe the concurrent processes because synchronization is supported as a language primitive. A producer/consumer model, in which a producer and a consumer cooperate using data-flow synchronization, is a typical programming style of these languages. However, one thing we must treat carefully is that the execution can fall into the state of perpetual suspension because of some mistakes in the programs, in the case of such data-flow computation. Fixing such mistakes would be very difficult if it were not for the implementation supports Therefore, as a practical tool for the software development, it is extremely important to detect an occurrence of such an illegal state and to notify it to users. This paper presents an algorithm to detect an occurrenceof perpetual suspension and to report the maximal goals from the causality graph of perpetual suspension. The algorithm takes advantage of the characteristics of copying garbage collection scheme, and have already been implemented on the Multi-PSI, a prototype of the parallel inference machines. KL1 (Computer program language) Parallel processing (Electronic computers) Onishi, Satoshi Verfasser aut Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 530 (DE-604)BV010923438 530 |
| spellingShingle | Inamura, Yu Onishi, Satoshi A detection algorithm of perpetual suspension in KL1 Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report KL1 (Computer program language) Parallel processing (Electronic computers) |
| title | A detection algorithm of perpetual suspension in KL1 |
| title_auth | A detection algorithm of perpetual suspension in KL1 |
| title_exact_search | A detection algorithm of perpetual suspension in KL1 |
| title_full | A detection algorithm of perpetual suspension in KL1 by Y. Inamura & S. Onishi |
| title_fullStr | A detection algorithm of perpetual suspension in KL1 by Y. Inamura & S. Onishi |
| title_full_unstemmed | A detection algorithm of perpetual suspension in KL1 by Y. Inamura & S. Onishi |
| title_short | A detection algorithm of perpetual suspension in KL1 |
| title_sort | a detection algorithm of perpetual suspension in kl1 |
| topic | KL1 (Computer program language) Parallel processing (Electronic computers) |
| topic_facet | KL1 (Computer program language) Parallel processing (Electronic computers) |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT inamurayu adetectionalgorithmofperpetualsuspensioninkl1 AT onishisatoshi adetectionalgorithmofperpetualsuspensioninkl1 |