DocumentCode
2035865
Title
Using dataflow principle to exploit restricted AND-parallelism in logic programs
Author
Kang Zhang
Author_Institution
Dept. of Comput., Macquarie Univ., Sydney, NSW, Australia
Volume
1
fYear
1993
fDate
19-21 Oct. 1993
Firstpage
150
Abstract
To improve the execution speed of logic programs, exploiting parallelism has proved promising. The paper presents a scheme supporting Restricted AND-parallelism improved over a previous scheme by exploiting more parallelism. The scheme is based on dataflow computation and implemented in a non-shared execution model, and thus taking advantages of distributed binding results. Comparison with the previous scheme is discussed and some examples given.<>
Keywords
logic programming; parallel programming; dataflow computation; dataflow principle; distributed binding results; logic programs; non-shared execution model; parallelism; restricted AND-parallelism; Computational modeling; Concurrent computing; Data analysis; Logic; Parallel processing; Runtime;
fLanguage
English
Publisher
ieee
Conference_Titel
TENCON '93. Proceedings. Computer, Communication, Control and Power Engineering.1993 IEEE Region 10 Conference on
Conference_Location
Beijing, China
Print_ISBN
0-7803-1233-3
Type
conf
DOI
10.1109/TENCON.1993.319950
Filename
319950
Link To Document