Skip to main content
Article thumbnail
Location of Repository

TS/Scheme: Distributed Data Structures in Lisp

By Suresh Jagannathan


We describe a parallel object-oriented dialect of Scheme calledts/schemethat provides a simple coordination framework is an abstraction that serves the role of a distributed data structure. Distributed data and expressive interface for building asynchronous parallel programs. The main component ints/scheme’s structures are an extension of conventional data structures insofar as many tasks may simultaneously access and update their contents according to a well-defined serialization protocol. The semantics of these structures also specifies that consumers which attempt to access an as-of-yet undefined element are to block until a producer provides a value. ts/schemepermits the construction of two basic kinds of distributed data structures, those accessed by content, and those accessed by name. These structures can be further specialized and composed to yield a number of other synchronization abstractions. Our intention is to provide an efficient medium for expressing concurrency and synchronization that is amenable to modular programming, and which can be used to succinctly and efficiently describe a variety of diverse concurrency paradigms useful for parallel symbolic computing

Topics: Symbolic Computation, Parallelism, Distributed Data Structures, Coordination, Object-Oriented Computing
Year: 1994
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.