• Corpus ID: 1716572


  author={Geoff Sutcliffe and James Pinakis},
This paper presents an embedding of the Linda parallel programming paradigm in Prolog. A mono-processor and a multi-processor implementation are described. Both implementations provide coarse grain parallelism to Prolog. The embedding of Linda in Prolog extends Linda's standard tuple space operations, permitting unification and Prolog style deduction in the tuple space. Examples of the added capabilities introduced by a deductive tuple space, as well as example applications of Prolog-Linda as a… 

Figures from this paper

S-Net for multi-memory multicores

A conservative language extension for the placement of components and component networks in a multi-memory environment, i.e. architectures that associate individual compute cores or groups thereof with private memories.

Message Driven Programming with S-Net: Methodology and Performance

It is argued that the S-NET approach delivers a flexible component technology which liberates application developers from the logistics of task and data management while at the same time making it unnecessary for a distributed computing professional to acquire detailed knowledge of the application area.

High-Level Message Passing without the Hassle

Runtimes obtained on a workstation cluster demonstrate how Distributed S-NET allows programmers with little or no background in parallel programming to make effective use of distributed memory architectures with minimal programming effort.

Distributed S-Net: High-level message passing without the hassle

Runtimes obtained on a workstation cluster demonstrate how Distributed S-NET allows programmers with little or no background in parallel programming to make effective use of distributed memory architectures with minimal programming effort.

2 From Tuplespaces to Informationspaces for the Web

The evolution of tuplespace computing is described, why tuplespaces are a suitable middleware for theSemantic Web and how XMLSpaces can be extended to support Semantic Web technologies, like RDF(S) and OWL are suggested.

Performance characterisation and verification of JavaSpaces based on design of experiments

  • F. HanckeT. DhaeneJ. Broeckhove
  • Computer Science
    The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, 2004. (MASCOTS 2004). Proceedings.
  • 2004
Design of experiments (DoE) is applied to evaluate and model the performance of JavaSpaces, a tuple spaces implementation for distributing tasks through a virtual space, a statistical technique for identifying relevant input factors from a (large) set of input factors.

TripCom Triple Space Communication FP 6 – 027324 Deliverable D 2 . 1 Representing RDF semantics in tuples

A novel model for representing RDF data within tuplespaces and organize them in order to optimize communication and coordination operations is introduced.

10 Examples of Situation Spaces

Designing the new business solutions that are semantic-oriented and context-aware is the main challenge for software engineers and it is also evident that new abstractions in information system need to cope with explicit representation of divers aspects of (meta)knowledge, context and reasoning.

Situation Spaces in Context-aware Business Solutions

A partial solution of content-oriented processing that combines ideas of tuple spaces, spaces of XML documents, the theory of situations and logic programming into one coherent mechanism that can be used to build context-aware business solutions.



Qu-Prolog 3.2 Reference Manual

This manual describes the features of Qu-Prolog, an extended Prolog that provides support for the representation, storage and transformation of high-level knowledge such as that used in science, mathematics and logic.

Parlog86 and the dining logicians

A growing number of logic programming languages have been refined to handle concurrent programming, one in particular is Parlog86, which challenges the power of any aspiring concurrent program language.

Foundations of Logic Programming

Shared tuple memories, shared memories, buses and lan's--linda implementations across the spectrum of connectivity

A new implementation of Linda based on a two-layer model is described, which reports on the results of some experiments in which a group of VAXes operating in parallel were able to attain performance competitive with super-computers on interesting problems.

Generative communication in Linda

This work is particularly concerned with implementation of the dynamic global name space that the generative communication model requires, and its implications for systems programming in distributed settings generally and on integrated network computers in particular.

A General Clause Theorem Prover

The completeness of the combination of the GC procedure and the RUE and NRF inference rules, is to be obtained by combining their respective completeness results.

Collected Papers

THIS volume is the first to be produced of the projected nine volumes of the collected papers of the late Prof. H. A. Lorentz. It contains a number of papersnineteen in all, mainly printed

Linda in context

How can a system that differs sharply from all currently fashionable approaches score any kind of success? Here's how.

Concurrent PROLOG: Collected Papers

Flat Concurrent Prolog is described, a comprehensive and radical approach to parallel computing that is based on a simple foundation, and can serve as a general-purpose high-level machine language for parallel computers.