DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Cho, Jung-Wan | - |
dc.contributor.advisor | 조정완 | - |
dc.contributor.author | Lee, Ho-Rae | - |
dc.contributor.author | 이호래 | - |
dc.date.accessioned | 2011-12-13T05:49:38Z | - |
dc.date.available | 2011-12-13T05:49:38Z | - |
dc.date.issued | 1985 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=64612&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/33639 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 전산학과, 1985.2, [ [ii], 53, [4] p. ] | - |
dc.description.abstract | A number of studies have been made on the parallelism embedded in the logic programming languages for the purpose of performance improvements in the execution of the logic programs. The difficulty of AND parallel execution is due to the shared variables between the subgoals. This problem can be resolved by the algorithm that controls which subgoal is solved first. The algorithm can be used either at compile-time or at run-time. The proposed model is applied to the tree-structured architecture, using the allocation algorithm which allocates the clauses to be unified with each subgoal of a clause to the child processors of the current processor which contains that clause. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.title | Parallel execution model of logic programs on the tree-structured architecture | - |
dc.title.alternative | Tree 구조하에서의 논리언어의 병렬수행모델 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 64612/325007 | - |
dc.description.department | 한국과학기술원 : 전산학과, | - |
dc.identifier.uid | 000831332 | - |
dc.contributor.localauthor | Cho, Jung-Wan | - |
dc.contributor.localauthor | 조정완 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.