(A) mode driven dataflow model for AND/OR parallelism of logic programs모드에 바탕을 둔 논리 프로그램을 위한 AND/OR 병렬 데이타플로우 모델

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 480
  • Download : 0
An important objective in logic programming research is to improved the performance of logic programming systems. A promising approach, in this respect, is to introduce parallelism into the program evaluation mechanism. Many of these models have, however, been based on the conventional approach of organizing concurrent components of computations as independent communicating processes. Some of them have the data-driven computation organizations. In this thesis, we investigate the application of the data-driven organization to the evaluation of lgic programs. Several kinds of parallelism can be found in logic programs. It is natural to associate the logic programming with a dataflow architecture to cope with the high parallelism. Since input/output relationships of arguments are not fixed in the logic programs, for the conventional dataflow models to exploit AND-parallelism, they require a run-time support to control the dynamic token flow which induces severe overhead, or the join operation whose cost is not cheap. Until now, there has been no evidence that the dataflow model has been successfully employed to exploit the AND-parallelism for pure logic programs. In this thesis, we propose D-Model, which is a mode driven dataflow model for AND/OR-parallelism of logic programs. In this model dataflow graphs supporting AND/OR-parallelism for logic programs can be produced through a graph generation procedure based on the mode which can be predicted at compile-time. Although the dataflow graph in the model does not provide an optimal AND-parallelism, there is no run-time overhead such as dynamic arcs between the literal nodes and no join operation between the literals. D-Model adopts the dataflow call-by-value mechanism and reduces the amount of multiset. The OR-parallelism is also supported. The mode can be generated at compile-time through a refined static data dependency analysis, which is a variation of the static data dependency analysis proposed by Chang, et. a...
Advisors
Cho, Jung-Wan조정완
Description
한국과학기술원 : 전산학과,
Publisher
한국과학기술원
Issue Date
1987
Identifier
61068/325007 / 000805253
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 전산학과, 1987.8, [ [vii], 102 p. ]

URI
http://hdl.handle.net/10203/32961
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=61068&flag=dissertation
Appears in Collection
CS-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0