Bibliographische Detailangaben

Beteiligte Personen:	Ueda, Kazunori (VerfasserIn), Morita, Masao (VerfasserIn)
Format:	Buch
Sprache:	Englisch
Veröffentlicht:	Tokyo, Japan 1990
Schriftenreihe:	Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 560
Schlagwörter:	Computer programs Horn clauses Logic programming
Abstract:	Abstract: "Concurrent processes can be used both for programming computation and for programming storage. Previous implementations of Flat GHC, however, have been tuned for computation-intensive programs, and perform poorly for storage-intensive programs (such as programs implementing reconfigurable data structures using processes and streams) and demand-driven programs. This paper proposes an optimization technique for programs in which processes are almost always suspended. The techique compiles unification for data transfer into message passing Instead of reducing the number of process switching operations, the technique optimizes the cost of each process switching operation and reduces the number of cons operations for data buffering. The technique is based on a mode system which is powerful enough to analyze bidirectional communication and streams of streams. The mode system is based on mode constraints imposed by individual program clauses rather than on global dataflow analysis. Benchmark results show that the proposed technique well improves the performance of storage-intensive programs and demand- driven programs compared with a conventional native-code implementation It also improves the performance of some computation-intensive programs. Although many problems remain to be solved particularly with regard to parallelization, we expect that the proposed technique will expand the application areas of concurrent logic languages.
Umfang:	15 S.