KLI

Data Flow개념하에서 AND/OR Parallelism실행에 관한 연구

Metadata Downloads
Alternative Title
A Study on Execution of AND/OR Parallelism based on DATa Flow Concept
Abstract
논리 프로그램에서의 AND/OR Parallelism을 Data Flow에서 실행시키는 방법은 [10,12] 등에서 제안되었다.

이 논문에서는 [10]에서 제안한 모형을 근간으로 하여, 논리 프로그램에서의 assertion이 data flow 그래프로 해석되는 방법을 보였고, 그래프 template를 Euler Path 가 아닌 Spanning Tree로 변형함으로써 AND Parallilism을 향상시킬 수 있음을 보였으며, 이러한 template 토큰들이 data flow 그래프의 각 노드로 전달되어 처리되는 과정을 제시하였다.
The execution models of AND/OR Parallelism in logic program are proposed in [10,12] that based on data flow concept

In this paper, based on the model that is proposed in [10], the method with that assertions in logic program are translated to data flow graphs is represented, and AND Parallelism can be incerased by incerased by transforming graph templates into Spanning Tree not Euler Path and a procedure for execution of temoplate tokens is represented by propagating these todens into nodes of data flow graph
The execution models of AND/OR Parallelism in logic program are proposed in [10,12] that based on data flow concept

In this paper, based on the model that is proposed in [10], the method with that assertions in logic program are translated to data flow graphs is represented, and AND Parallelism can be incerased by incerased by transforming graph templates into Spanning Tree not Euler Path and a procedure for execution of temoplate tokens is represented by propagating these todens into nodes of data flow graph
Author(s)
옥철영
Issued Date
1987
Type
Research Laboratory
URI
https://oak.ulsan.ac.kr/handle/2021.oak/4946
http://ulsan.dcollection.net/jsp/common/DcLoOrgPer.jsp?sItemId=000002025287
Alternative Author(s)
Ock, Cheol-Young
Publisher
연구논문집
Language
kor
Rights
울산대학교 저작물은 저작권에 의해 보호받습니다.
Citation Volume
18
Citation Number
2
Citation Start Page
119
Citation End Page
126
Appears in Collections:
Research Laboratory > University of Ulsan Report
Authorize & License
  • Authorize공개
Files in This Item:

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.