We use cookies to improve your experience with our site.
Zheng Yuhua, Xie Li, Sun Zliongxiu. Full Or-Parallemism and Restricted And-Parallelism in BTM[J]. Journal of Computer Science and Technology, 1994, 9(4): 373-381.
Citation:
Zheng Yuhua, Xie Li, Sun Zliongxiu. Full Or-Parallemism and Restricted And-Parallelism in BTM[J]. Journal of Computer Science and Technology, 1994, 9(4): 373-381.
Zheng Yuhua, Xie Li, Sun Zliongxiu. Full Or-Parallemism and Restricted And-Parallelism in BTM[J]. Journal of Computer Science and Technology, 1994, 9(4): 373-381.
Citation:
Zheng Yuhua, Xie Li, Sun Zliongxiu. Full Or-Parallemism and Restricted And-Parallelism in BTM[J]. Journal of Computer Science and Technology, 1994, 9(4): 373-381.
Full Or-Parallemism and Restricted And-Parallelism in BTM
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.
DownLoad: