Treffer: A methodology for parallel structured programming in logic environments

To fully exploit the advantages and the potential of new parallel computer systems, it is necessary to design suitable parallel algorithms. In fact, for speeding-up the computation, parallel algorithms for both architectures and new languages are needed. The appropriate implementation of these algorithms on parallel processors is crucial and requires new programming skills. Therefore, in order to exploit the strength of parallel systems, it has become increasingly important to define a parallel-programming methodology. In this paper, a methodology based on the computation graph, for designing structured algorithms for parallel-logic programming will be described. The proposed methodology aims both to improve system performance and to allow unskilled users to define and to implement parallel-logic programs. As an application of the proposed methodology, an algorithm has been completely developed and its performance is described below. The parallel-logic language STRAND running on a Hypercube Intel-iPSC/2 system has been used.