The S/Net's Linda kernel

Carriero, Nicholas; Gelernter, David

doi:10.1145/214419.214420

Cited by 130 publications

(52 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Linda [4] has been an active research topic for over two decades. It represents a model of coordination and communication among parallel processes based on logically global associative memory, called a tuplespace, in which processes store and retrieve tuples.…”

Section: Related Workmentioning

confidence: 99%

A Communication Framework for Fault-Tolerant Parallel Execution

Kanna

Subhlok

Gabriel

et al. 2010

Languages and Compilers for Parallel Computing

View full text Add to dashboard Cite

Abstract. PC grids represent massive computation capacity at a low cost, but are challenging to employ for parallel computing because of variable and unpredictable performance and availability. A communicating parallel program must employ checkpoint-restart and/or process redundancy to make continuous forward progress in such an unreliable environment. A communication model based on one-sided Put/Get calls, pioneered by the Linda system, is a good match as processes can execute their communication operations independently and asynchronously. However, Linda and its many variants are not designed for communicating processes that are replicated or independently restarted from checkpoints. The key problem is that a single logical operation that impacts the global program state may be executed by different instances of the same process at different times leading to semantic inconsistency. This paper presents the design, execution model, implementation, and validation of a communication layer for robust execution on volatile nodes. The research leads to a practical way to employ idle PCs for latency tolerant parallel computing applications.

show abstract

Section: Related Workmentioning

confidence: 99%

A Communication Framework for Fault-Tolerant Parallel Execution

Kanna

Subhlok

Gabriel

et al. 2010

Languages and Compilers for Parallel Computing

View full text Add to dashboard Cite

show abstract

“…It thus enables tests and incremental deployment of IPNL, TRIAD, Heaps, and Network Pointer architectures. It is fundamentally based on the Linda [6] system's tuple-style message delivery, integrated with existing IP forwarding and extended with rewriting capability. IPNL is a multi-level routing hierarchy, utilizing different forwarding tags at various routing levels [13].…”

Section: Related Workmentioning

confidence: 99%

DataRouter: A Network-Layer Service for Application-Layer Forwarding

Touch

Pingali

2004

Active Networks

View full text Add to dashboard Cite

Abstract. DataRouter forwards network layer packets using application layer tags, without requiring per-hop termination of transport protocols and the consequent reimplementation of transport services in the application. DataRouter provides network delivery based on pattern matching and string replacement. It combines a byte string as a loose source route IP option tag and regular expression routing entries to provide a new network service. DataRouter tags have a variety of forms, including fixed-length with exact matches for distributed hash tables and variable-length with regular expression matches for URL redirection. Tagged IPv6 packets traverse non-DataRouter routers transparently. On a platform forwarding IPv4 packets at 310K packets/sec., an unoptimized FreeBSD IPv4 DataRouter forwards hash-match packets at up to 270K packets/sec. (87% of max.) and pattern-match packets 155K packets/sec. (50% of max.). DataRouter thus provides a viable, higher-performance alternative to application-layer implementation of forwarding, in a generic service more interoperable with existing network and transport protocols.

show abstract

“…They range from bare distributed shared memory support such as the Mether system [28], TreadMarks [2], and Munin [13] to high level shared memory abstractions such as Orca [7] and Linda [12]. Shared memory abstractions appear to provide much easier programming interface than message passing.…”

Section: Existing Distributed Programming Approachesmentioning

confidence: 99%

“…Two computing entities are synchronized at initiation time or completion time of tasks. The Linda [12] system is an example of task synchronous COP approach. Tasks can be deposited in a tuple space and decoupled processes pickup the deposited tasks.…”

Section: Task Synchronous Systemsmentioning

confidence: 99%

“…Parallel programming on workstation systems is a relatively new field and has been an attractive proposition ever since it was used in some of its early forms such as the RPC thread based system of Bal, Renesse, and Tanenbaum [8]. Other examples of parallel programming approaches on workstation systems are the IPC [38] based message passing systems, RPC thread-based systems [32], distributed shared memories [39] such as Mether system [28], programming tools such as PVM [40] and P4 [11] and programming languages such as Orca [7] and Linda [12].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Anonymous remote computing: a paradigm for parallel programming on interconnected workstations

Joshi

Ram

1999

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

Abstract-Parallel computing on interconnected workstations is becoming a viable and attractive proposition due to the rapid growth in speeds of interconnection networks and processors. In the case of workstation clusters, there is always a considerable amount of unused computing capacity available in the network. However, heterogeneity in architectures and operating systems, load variations on machines, variations in machine availability, and failure susceptibility of networks and workstations complicate the situation for the programmer. In this context, new programming paradigms that reduce the burden involved in programming for distribution, load adaptability, heterogeneity, and fault tolerance gain importance. This paper identifies the issues involved in parallel computing on a network of workstations. The Anonymous Remote Computing (ARC) paradigm is proposed to address the issues specific to parallel programming on workstation systems. ARC differs from the conventional communicating process model by treating a program as one single entity consisting of several loosely coupled remote instruction blocks instead of treating it as a collection of processes. The ARC approach results in distribution transparency and heterogeneity transparency. At the same time, it provides fault tolerance and load adaptability to parallel programs on workstations. ARC is developed in a two-tiered architecture consisting of high level language constructs and low level ARC primitives. The paper describes an implementation of the ARC kernel supporting ARC primitives.

show abstract

The S/Net's Linda kernel

Cited by 130 publications

References 8 publications

A Communication Framework for Fault-Tolerant Parallel Execution

A Communication Framework for Fault-Tolerant Parallel Execution

DataRouter: A Network-Layer Service for Application-Layer Forwarding

Anonymous remote computing: a paradigm for parallel programming on interconnected workstations

Contact Info

Product

Resources

About