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 ...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.展开更多
Logic programs offer many opportunities for the exploitation of parallelism.But the parallel execution of a task incurs various overheads This paper focuses on the issues relevant to parallelizing Prolog on shared-mem...Logic programs offer many opportunities for the exploitation of parallelism.But the parallel execution of a task incurs various overheads This paper focuses on the issues relevant to parallelizing Prolog on shared-memory multiprocessors efficiently.展开更多
This paper presents a process model, based on the OR-forest description, for the parallel execution of logic programs. In the PSOF model, the parallel execution of a program is realized by the parallel search of the u...This paper presents a process model, based on the OR-forest description, for the parallel execution of logic programs. In the PSOF model, the parallel execution of a program is realized by the parallel search of the unique OR-forest for the program: an OR-parallel execution of a goal is carried out by successor processes simultaneously searching multiple branches, and all the processes searching the same tree are logically independent and need not communicating; AND-parallel execution of a goal is practised by slave processes simultaneously searching multiple trees. A slave process sends a message to its master process only when it reaches a leaf node. The subject of the automatic partition of sub-goals in the framework of OR-forest is also discussed in this paper.展开更多
文摘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.
基金This nesearch was partially supported by National Natural Science Foundation of China.
文摘Logic programs offer many opportunities for the exploitation of parallelism.But the parallel execution of a task incurs various overheads This paper focuses on the issues relevant to parallelizing Prolog on shared-memory multiprocessors efficiently.
文摘This paper presents a process model, based on the OR-forest description, for the parallel execution of logic programs. In the PSOF model, the parallel execution of a program is realized by the parallel search of the unique OR-forest for the program: an OR-parallel execution of a goal is carried out by successor processes simultaneously searching multiple branches, and all the processes searching the same tree are logically independent and need not communicating; AND-parallel execution of a goal is practised by slave processes simultaneously searching multiple trees. A slave process sends a message to its master process only when it reaches a leaf node. The subject of the automatic partition of sub-goals in the framework of OR-forest is also discussed in this paper.
