Based on a thorough study of the relationship between array element accesses and loop indices of the nested loop, a method is presented with which the staggering relation and the compacting relation between the thread...Based on a thorough study of the relationship between array element accesses and loop indices of the nested loop, a method is presented with which the staggering relation and the compacting relation between the threads of the nested loop (either with a single linear function or with multiple linear functions) can be determined at compile-time,and accordingly the nested loop (either perfectly nested one or imperfectly nested one)can be restructured to avoid the thrashing problem. Due to its simplicity, our method can be efficiently implemented in any parallel compiler, and the improvement of the performance is significant as shown by the experimental results.展开更多
The relationship between TMS and general logic programs is an important issue in non-monotonic logic programming. In this paper, we prove that, after we translate the TMS theory into a general logic program, the TMS...The relationship between TMS and general logic programs is an important issue in non-monotonic logic programming. In this paper, we prove that, after we translate the TMS theory into a general logic program, the TMS's well-founded assignment (orextension) is equivalent to the corresponding general logic program's stable model. It means that TMS can be completely integrated into a non-monotonic logic programming environment.展开更多
摘要Based on a thorough study of the relationship between array element accesses and loop indices of the nested loop, a method is presented with which the staggering relation and the compacting relation between the threads of the nested loop (either with a single linear function or with multiple linear functions) can be determined at compile-time,and accordingly the nested loop (either perfectly nested one or imperfectly nested one)can be restructured to avoid the thrashing problem. Due to its simplicity, our method can be efficiently implemented in any parallel compiler, and the improvement of the performance is significant as shown by the experimental results.
摘要The relationship between TMS and general logic programs is an important issue in non-monotonic logic programming. In this paper, we prove that, after we translate the TMS theory into a general logic program, the TMS's well-founded assignment (orextension) is equivalent to the corresponding general logic program's stable model. It means that TMS can be completely integrated into a non-monotonic logic programming environment.