Implementation of an Event Driven Scheme for Visualizing Parallel Execution of Logic Programs

This article presents in an informal way some early results on the design of a series of paradigms for visualization of the parallel execution of logic programs. The results presented here refer to the visualization of or-parallelism, as in MUSE and Aurora, deterministic dependent and-parallelism, as in Andorra-I, and independent and-parallelism as in &-Prolog. A tool has been implemented for this purpose and has been interfaced with these systems. Results are presented showing the visualization of executions from these systems and the usefulness of the resulting tool is briefly discussed. 1 Introduction The difficulty of parallel programming and the lack of cost-effective parallel hardware have been traditionally considered the main hindrances to the wide spread use of parallelism. While cost-effective parallel computers are now appearing in the marketplace, the lack of software able to exploit parallelism in an efficient way is still an important bottleneck. In general, making a goo..