Live Webcast 15th Annual Charm++ Workshop

-->

PPL/Charm++ at SC17

A Chare Kernel Implementation of a Parallel Prolog Compiler
ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming (PPoPP) 1990
Publication Type: Paper
Repository URL:
Abstract
We have designed and implemented a compiler for the parallel execution of Prolog programs as a machine independent application on top of a run time environment for parallel programming called the Chare Kernel. The compiler is based on the Reduce-OR process model for the AND and OR parallel execution of Prolog programs and hence exploits both OR and independent AND parallelism found in Prolog programs. We describe the salient features of the parallel Prolog compiler from the viewpoint of its implementation as a Chare Kernel application. The responsibilities of process creation, load balancing, queueing strategies for work: pool management, memory management and interprocess communication are all assumed by the Chare Kernel thereby eliminating these concerns at the application level. We discuss the effectiveness of this separation for a large application like the parallel Prolog compiler. The machine independence property makes the compiler easy to port on all machines, both shared and nonshared, that support the Chare Kernel. The compiler has been implemented on a variety of machines, including the Encore Multimax, the Sequent Symmetry, the Intel iPSC/2 hypercube and the Alliant FX/S. We briefly discuss its performance on a range of benchmarks exhibiting AND, OR and AND/OR parallelism on two of these machines. The speedups obtained are linear, demonstrating the effectiveness of the Chare Kernel as a simple, elegant, yet powerful environment for parallel programming.
TextRef
B. Ramkumar and L. V. Kale, "A Chare Kernel Implementation of a Parallel Prolog Compiler", Proceedings of the Second Conference on Principles and Practice of Parallel Programming, Seattle, WA, March 1990, pp. 99-108.
People
Research Areas