Publications

Publications by CRACS

1994

Scheduling Algorithms Performance with the pSystem Parallel Programming Environment

Authors
Lopes, LMB; Silva, FMA;

Publication
PARLE '94: Parallel Architectures and Languages Europe, 6th International PARLE Conference, Athens, Greece, July 4-8, 1994, Proceedings

Abstract
The efficiency of scheduling algorithms is essential in order to attain optimal performances from parallel programming systems. In this paper we use a portable parallel programming environment we have implemented, the pSystem, to evaluate and compare the performance of various scheduling algorithms on shared memory parallel machines. © Springer-Verlag Berlin Heidelberg 1994.

CloseRead Abstract

1994

OR-PARALLEL PROLOG ON DISTRIBUTED SHARED-MEMORY ARCHITECTURES

Authors
SILVA, FMA;

Publication
IMPLEMENTATIONS OF LOGIC PROGRAMMING SYSTEMS

Abstract

1994

Aurora, Andorra-I and Friends on the Sun

Authors
Costa, VS; Correia, ME; Silva, FMA;

Publication
Proceedings of the ILPS 94 Workshop on Design and Implementation of Parallel Logic Programming Systems, Ithaca, New York, USA, November 18, 1994

Abstract

1994

A System to Visualize and Interact with Prolog Programs

Authors
Leal, JP;

Publication
Programming Language Implementation and Logic Programming, 6th International Symposium, PLILP'94, Madrid, Spain, September 14-16, 1994, Proceedings

Abstract

1994

Visualization and Interaction in Logic Programming

Authors
Leal, JP;

Publication
Sixth Workshop on Logic Programming Environments, ICLP 1994 post Conference Workshop W4, Technical Report, Institutt for datateknikk og telematikk, Norges

Abstract

1994

Optimal implementation of and-or parallel Prolog

Authors
Gupta, G; Costa, VS;

Publication
Future Generation Comp. Syst.

Abstract
Most models that have been proposed, or implemented, so far for exploiting both or-parallelism and independent and-parallelism have only considered pure logic programs (pure Prolog). We present an abstract model, called the Composition-Tree, for representing and-or parallelism in full Prolog. The Composition-Tree recomputes independent goals to ensure that Prolog semantics is preserved. We combine the idea of Composition-Tree with ideas developed earlier, to develop an abstract execution model that supports full Prolog semantics while at the same time avoiding redundant inferences when computing solutions to (purely) independent and-parallel goals. This is accomplished by sharing solutions of independent goals when they are pure (i.e. have no side-effects or cuts in them). The Binding Array scheme is extended for and-or parallel execution based on this abstract execution model. This extension enables the Binding Array scheme to support or-parallelism in the presence of independent and-parallelism, both when solutions to independent goals are recomputed as well as when they are shared. We show how extra-logical predicates, such as cuts and side-effects, are supported in this model. © 1994.

CloseRead Abstract