2003
Authors
Figueira, AR; Paulino, H; Lopes, L; Silva, F;
Publication
JOURNAL OF UNIVERSAL COMPUTER SCIENCE
Abstract
We describe a programming language for distributed computations that supports mobile resources and is based on a process calculus. The syntax, semantics and implementation of the language are presented with a focus on the novel model of computation.
2003
Authors
Paulino, H; Lopes, L; Silva, F;
Publication
WEB ENGINEERING, PROCEEDINGS
Abstract
Mobile agents are the latest software technology to program flexible and efficient distributed applications. Most current systems implement semantics that are hard if not impossible to prove correct. In this paper we present MOB, a scripting language for Internet agents encoded on top of a process calculus and with provably sound semantics.
2003
Authors
Fonseca, N; Costa, VS; Silva, F; Camacho, R;
Publication
PROGRESS IN ARTIFICIAL INTELLIGENCE
Abstract
2003
Authors
Rocha, R; Silva, F; Martins, R;
Publication
PROGRESS IN ARTIFICIAL INTELLIGENCE
Abstract
This paper discusses the design of YapDss, an or-parallel Prolog system for distributed memory parallel machines, such as the Beowulf PC clusters. The system builds on the work of YapOr, an or-parallel system for shared memory machines, and uses the distributed stack splitting binding model to represent computation state and work sharing among the computational workers. A new variant scheme of stack splitting, the diagonal splitting, is proposed and implemented. This scheme includes efficient algorithms to balance work load among computing workers, to determine the bottommost common node between two workers, and to calculate exactly the work load of one worker. An initial evaluation of the system shows that it is able to achieve very good speedups on a Beowulf PC cluster.
2003
Authors
Lopes, R; Costa, VS; Silva, F;
Publication
PROGRESS IN ARTIFICIAL INTELLIGENCE
Abstract
2003
Authors
Paulino, H; Marques, P; Lopes, L; Vasconcelos, V; Silva, F;
Publication
PARALLEL COMPUTING TECHNOLOGIES, PROCEEDINGS
Abstract
We describe a reference implementation of a multi-threaded run-time system for a core programming language based on a process calculus. The core language features processes running in parallel and communicating through asynchronous messages as the fundamental abstractions. The programming style is fully declarative, focusing on the interaction patterns between processes. The parallelism, implicit in the syntax of the programs, is effectively extracted by the language compiler and explored by the run-time system.
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.