首页 | 本学科首页   官方微博 | 高级检索  
     

Full Or-Parallemism and Restricted And-Parallelism in BTM
引用本文:Zheng Yuhua,Xie Li,Sun Zliongxiu. Full Or-Parallemism and Restricted And-Parallelism in BTM[J]. 计算机科学技术学报, 1994, 9(4): 373-381. DOI: 10.1007/BF02943584
作者姓名:Zheng Yuhua  Xie Li  Sun Zliongxiu
作者单位:[1]DepartmentofComputerScience,NanjingUniversity,Nanjing210008 [2]DepartmentofComputerScience,NanjingUniver
摘    要:BTM is a new And/Or parallel execution model for logic programs which exploits both full Or-parallelism and restricted And-parallelism.The advantages of high parallelism and low run time cost make BTJ,an experimental execution system of BTM implemented on a nonshared-memory multiprocessor system,achieve significant speedup for both And-paralled and Or-parallel logic programs.

关 键 词:逻辑程序设计 并行执行模型 控制方案

Full or-parallemism and restricted And-parallelism in BTM
Yuhua Zheng,Li Xie,Zhongxiu Sun. Full or-parallemism and restricted And-parallelism in BTM[J]. Journal of Computer Science and Technology, 1994, 9(4): 373-381. DOI: 10.1007/BF02943584
Authors:Yuhua Zheng  Li Xie  Zhongxiu Sun
Affiliation:Department of Computer Science; Nanjing University; Nanjing 210008;
Abstract: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.
Keywords:Full Or-parallelism   restricted And-parallelism   multi-transputer system   nonshared-memory  extra-predicates
本文献已被 CNKI 维普 SpringerLink 等数据库收录!
点击此处可从《计算机科学技术学报》浏览原始摘要信息
点击此处可从《计算机科学技术学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号