A parallel problem solving language ANDOR-II and its parallel implementation:

Abstract: "This paper presents a parallel problem solving language ANDOR-II and its parallel implementation. Our purpose is 1) to realize a full combination of AND- and OR-parallelism suitable for a parallel problem solving, and 2) to find a class which can be transformed into KL1. ANDOR-II is...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Takahashi, Kazuko (VerfasserIn), Takeuchi, Akikazu (VerfasserIn)
Format: Buch
Sprache:English
Veröffentlicht: Tokyo, Japan 1990
Schriftenreihe:Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 558
Schlagworte:
Zusammenfassung:Abstract: "This paper presents a parallel problem solving language ANDOR-II and its parallel implementation. Our purpose is 1) to realize a full combination of AND- and OR-parallelism suitable for a parallel problem solving, and 2) to find a class which can be transformed into KL1. ANDOR-II is born for parallel problem solving on concurrent systems which consist of determinate, indeterminate and nondeterminate components interacting [sic] each other. Problems on these systems are complicated since the number of possible bahaviors of some components may increase dynamically, and a behavior of some component may affect its own behavior in future
ANDOR-II provides the declarative description for that sort of problems [sic]. The execution of ANDOR-II exploits both AND- and OR- parallelism based on a concept of a 'color.' Each possible behavior is associated with a distinct color and a color may be refined as computation proceeds. The fork of nondeterminate processes occurs eagerly, which provides a fine grain parallelism. A program written in ANDOR-II is transformed into that in KL1 so that OR-parallelism in ANDOR-II is compiled into AND-parallelism in the object code by means of a stream-based compilation. Both the compiler and runtime system are written in KL1 and they are now running on Multi-PSI system (without processor allocation).
Beschreibung:27 S.