GRANULARITY ANALYSIS FOR LOGIC PROGRAMS
逻辑程序的并行性粒度的分析

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.