1999
Authors
Costa, VS;
Publication
IPPS/SPDP 1999: 13TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM & 10TH SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS
Abstract
In order for parallel logic programming systems to become popular; they should serve the broadest range of applications. To achieve this goal, designers of parallel logic programming systems would like to exploit maximum parallelism for existing and novel applications. ideally by supporting both and-parallelism and or-parallelism. Unfortunately; the combination of both forms of parallelism is a hard problem, and available proposals cannot match the efficiency of; say, or-parallel only systems. We propose a novel approach to And/Or Parallelism in logic programs. Our initial observation is that stack copying, the most popular technique in or-parallel systems, does not work well with And/Or systems because network management is much more complex. Copying is also a significant problem in operating system where the copy-on-write (COW) has been dcl eloped to address the problem We demonstrate that this technique can also be applied to And/Or systems, and present both shared memory and distributed shared memory designs.
1999
Authors
Silva, MG; Dutra, IC; Bianchini, R; Costa, VS;
Publication
PRACTICAL ASPECTS OF DECLARATIVE LANGUAGES
Abstract
In this work we investigate how different machine settings for a hardware Distributed Shared Memory (DSM) architecture affect the performance of parallel logic programming (PLP) systems. We use execution-driven simulation of a DASH-like multiprocessor to study the impact of the cache block size, the cache size, the network bandwidth, the write buffer size, and the coherence protocol on the performance of Andorra-I, a PLP system capable of exploiting implicit parallelism in Prolog programs. Among several other observations, we find that PLP systems favour small cache blocks regardless of the coherence protocol, while they favour large cache sizes only in the case of invalidate-based coherence. We conclude that the cache block size, the cache size, the network bandwidth, and the coherence protocol have a significant impact on the performance, while the size of the write buffer is somewhat irrelevant.
1999
Authors
Lopes, R; Costa, VS;
Publication
1999 Joint Conference on Declarative Programming, AGP'99, L'Aquila, Italy, September 6-9, 1999
Abstract
1999
Authors
Shen, K; Costa, VS; King, A;
Publication
Journal of Functional and Logic Programming
Abstract
1999
Authors
Calegario, VM; Dutra, IdC;
Publication
Euro-Par '99 Parallel Processing, 5th International Euro-Par Conference, Toulouse, France, August 31 - September 3, 1999, Proceedings
Abstract
In this work we investigate how Distributed Shared Memory (DSM) architectures affect performance of or-parallel logic programming systems and how this performance approaches that of conventional C systems. Our work concentrates on basic performance, scalability, and programmability. We use execution-driven simulation of a hardware DSM (DASH) to investigate the access patterns and caching behaviour exhibited by parallel C programs and by Aurora, a parallel logic programming system capable of exploiting implicit parallelism in Prolog programs. Aurora was originally written to run on bus-based shared-memory platforms. © Springer-Verlag Berlin Heidelberg 1999.
1998
Authors
Vasconcelos, VT; Lopes, LMB; Silva, FMA;
Publication
Electr. Notes Theor. Comput. Sci.
Abstract
We propose a simple model of distribution for mobile processes, independent of the underlying calculus. Conventional processes compute within sites; inter-site computation is achieved by message sending and object migration, both obeying a lexical scope. We focus on the semantics of networks, on programming practice, and on physical realization with current technology. ©1998 Published by Elsevier Science B.V.
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.