微信服务号

微信订阅号

2025-4-4- 10
Home > Archive>Volume 5, Issue 10, 1994 >50-54
PDF HTML XML Export Cite reminder
GRANULARITY ANALYSIS FOR LOGIC PROGRAMS
Author:
Affiliation:

  • Article
    • | |
  • Metrics
    • |
  • Reference [1]
    • |
  • Related
    • |
  • Cited by
    • | |
  • Comments
    Abstract:

    This paper discusses the problem of granularity while exploiting AND-parallelism in logic programs. The authors give evaluation formulas of granularity under their computation model. An example is given to show how the execution graph expressions are optimized with the size of grain.

    Reference
    1 Huang Zhiyi．Hu Shouren．A compiling approach for exploiting AND—parallelism in parallel logic programmingsystems．Proc．of Parallel Architecture and Language Europe，Netherlands，1989：335—345． 2 Debray S K．Lin Naiwei．Task granularity analysis in logic programs．Technical Report，Dept．of Comp．Sci．，U-niv．of Arizona，1990． 3 Tick E．Compile—time granularity analysis for parallel logic programming languages．Proc．of Inte．Conf．on 5thGeneration Computer Systems，Japan，19881994—1000． 4 Gao Yaoqing，Hu Shouren，Sun Chengzheng．Design and implementation of RAP/LOP parallel abstract machine．Inter．Conf．on Info．Processing，Japan，1990． 5 Huang Zhiyi，Hu Shouren，Sun Chengzheng et al．Reduction of code space in parallel logic programming systems．Proc．of Parallel Architecture and Language Europe，1991．
    Related
    Cited by
Get Citation

黄志毅,胡守仁.逻辑程序的并行性粒度的分析.软件学报,1994,5(10):50-54

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:January 03,1992
  • Revised:April 07,1992
Links:Institute of Software, CASChina Computer FederationCASNSFC
You are the first2032798Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063