Using dataflow principle to exploit restricted and-parallelism in logic programs

Kang Zhang

Using dataflow principle to exploit restricted and-parallelism in logic programs

Kang Zhang^*

^*Corresponding author for this work

Research output: Chapter in Book/Conference Proceeding/Report › Conference Paper published in a book › peer-review

Abstract

To improve the execution speed of logic programs, exploiting parallelism has proved to be 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.

Original language	English
Title of host publication	Proceedings of the 10th IEEE Region Conference on Computer, Communication, Control and Power Engineering
Publisher	Publ by IEEE
Pages	150-153
Number of pages	4
ISBN (Print)	0780312333
Publication status	Published - 1993
Externally published	Yes
Event	Proceedings of the 1993 IEEE Region 10 Conference on Computer, Communication, Control and Power Engineering (TENCON '93). Part 1 (of 5) - Beijing, China Duration: 19 Oct 1993 → 21 Oct 1993

Publication series

Name	Proceedings of the 10th IEEE Region Conference on Computer, Communication, Control and Power Engineering

Conference

Conference	Proceedings of the 1993 IEEE Region 10 Conference on Computer, Communication, Control and Power Engineering (TENCON '93). Part 1 (of 5)
City	Beijing, China
Period	19/10/93 → 21/10/93

Cite this

@inproceedings{da05f8280235471286690ca11ed232d8,

title = "Using dataflow principle to exploit restricted and-parallelism in logic programs",

abstract = "To improve the execution speed of logic programs, exploiting parallelism has proved to be 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.",

author = "Kang Zhang",

year = "1993",

language = "English",

isbn = "0780312333",

series = "Proceedings of the 10th IEEE Region Conference on Computer, Communication, Control and Power Engineering",

publisher = "Publ by IEEE",

pages = "150--153",

booktitle = "Proceedings of the 10th IEEE Region Conference on Computer, Communication, Control and Power Engineering",

note = "Proceedings of the 1993 IEEE Region 10 Conference on Computer, Communication, Control and Power Engineering (TENCON '93). Part 1 (of 5) ; Conference date: 19-10-1993 Through 21-10-1993",

}

Zhang, K 1993, Using dataflow principle to exploit restricted and-parallelism in logic programs. in Proceedings of the 10th IEEE Region Conference on Computer, Communication, Control and Power Engineering. Proceedings of the 10th IEEE Region Conference on Computer, Communication, Control and Power Engineering, Publ by IEEE, pp. 150-153, Proceedings of the 1993 IEEE Region 10 Conference on Computer, Communication, Control and Power Engineering (TENCON '93). Part 1 (of 5), Beijing, China, 19/10/93.

Using dataflow principle to exploit restricted and-parallelism in logic programs. / Zhang, Kang.
Proceedings of the 10th IEEE Region Conference on Computer, Communication, Control and Power Engineering. Publ by IEEE, 1993. p. 150-153 (Proceedings of the 10th IEEE Region Conference on Computer, Communication, Control and Power Engineering).

Research output: Chapter in Book/Conference Proceeding/Report › Conference Paper published in a book › peer-review

TY - GEN

T1 - Using dataflow principle to exploit restricted and-parallelism in logic programs

AU - Zhang, Kang

PY - 1993

Y1 - 1993

N2 - To improve the execution speed of logic programs, exploiting parallelism has proved to be 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.

AB - To improve the execution speed of logic programs, exploiting parallelism has proved to be 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.

UR - http://www.scopus.com/inward/record.url?scp=0027812840&partnerID=8YFLogxK

M3 - Conference Paper published in a book

AN - SCOPUS:0027812840

SN - 0780312333

T3 - Proceedings of the 10th IEEE Region Conference on Computer, Communication, Control and Power Engineering

SP - 150

EP - 153

BT - Proceedings of the 10th IEEE Region Conference on Computer, Communication, Control and Power Engineering

PB - Publ by IEEE

T2 - Proceedings of the 1993 IEEE Region 10 Conference on Computer, Communication, Control and Power Engineering (TENCON '93). Part 1 (of 5)

Y2 - 19 October 1993 through 21 October 1993

ER -

Using dataflow principle to exploit restricted and-parallelism in logic programs

Abstract

Publication series

Conference

Other files and links

Fingerprint

Cite this