%0 Journal Article
%T Detection of and-parallelism in logic programs<br>Detection of And-Parallelism in Logic Programs
%A Zhiyi Huang
%A Shouren Hu
%A <br>Huang Zhiyi
%A Hu Shouren
%J 计算机科学技术学报
%D 1990
%I 
%X In this paper, we present a detection technique of and-parallelism in logic programs. The detection consists of three phases: analysis of entry modes, derivation of exit modes and determination of execution graph expressions. Compared with other techniques2, 4, 5], our approach, with the compile- time program- level data- dependence analysis of logic programs, can efficiently exploit and- parallelism in logic programs. Two precompilers, based on our technique and DeGroot’s approach3] respectively, have been implemented in SES- PIM system12]. Through compiling and running some typical benchmarks in SES- PIM, we conclude that our technique can, in most cases, exploit as much and- parallelism as the dynamic approach13] does under “producer- consumer” scheme, and needs less dynamic overhead while exploiting more and-parallelism than DeGroot’s approach does. This research was partially supported by the Fok Ying Tung Education Foundation.
%K 逻辑程序
%K 检测技术
%K 并行性
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=AB68D885EA9BEAA9D2CAB6EB1C8BC646&yid=8D39DA2CB9F38FD0&vid=94C357A881DFC066&iid=E158A972A605785F&sid=9EF602EA28138BEA&eid=117BC32987199759&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=0&reference_num=15