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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Inamura, Yu (VerfasserIn), Onishi, Satoshi (VerfasserIn)
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.

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand!