1988•DSpace@MIT (Massachusetts Institute of Technology)Open access

A FAULT-TOLERANT NETWORK KERNEL FOR LINDA

Alice Xu

Open full text 11 citations

Abstract

The parallel programming system Linda consists of a number of processes and a shared memory called the tuple space. In a distributed implementation of Linda, processes and the tuple space reside on different computing nodes connected by a communications network subject to a variety of node and network failures.

Open-access reader

About this research paper

What this paper is about

The parallel programming system Linda consists of a number of processes and a shared memory called the tuple space. In a distributed implementation of Linda, processes and the tuple space reside on different computing nodes connected by a communications network subject to a variety of node and network failures.

Why it matters

OpenAlex reports 11 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The parallel programming system Linda consists of a number of processes and a shared memory called the tuple space. In a distributed implementation of Linda, processes and the tuple space reside on different computing nodes connected by a communications network subject to a variety of node and network failures.

Key concepts: Computer science, Tuple space, Tuple, Distributed computing, Protocol (science), Replication (statistics), Node (physics), Exploit

Related papers

Back to paper searchBrowse research topicsOriginal source
A FAULT-TOLERANT NETWORK KERNEL FOR LINDA — Research Paper | ScholarLens