Full Or-Parallemism and Restricted And-Parallelism in BTM  

作　　者：郑宇华 谢立 孙钟秀 

机构地区：[1]DepartmentofComputerScience,NanjingUniversity,Nanjing210008

出　　处：《Journal of Computer Science & Technology》1994年第4期373-381,共9页计算机科学技术学报（英文版）

摘　　要：BTM is a new And/Or parallel execution model for logic programs which exploits both full orparallelism and restricted Andparallelism. The advantages of high parallelism and low rtm time cost make BTJ, an exPerhoental execution system of BTM implemented on a nonsharedmemory multiprocessor system, achieve significant speedup for both And-parallel and Or-parallel logic Programs.BTM is a new And/Or parallel execution model for logic programs which exploits both full orparallelism and restricted Andparallelism. The advantages of high parallelism and low rtm time cost make BTJ, an exPerhoental execution system of BTM implemented on a nonsharedmemory multiprocessor system, achieve significant speedup for both And-parallel and Or-parallel logic Programs.

关 键 词：Full Or-parallelism  restricted And-parallelism  multi-transputer system  nonshared-memory extra-predicates 

分 类 号：TP311.1[自动化与计算机技术—计算机软件与理论]