Persistent Immutable Shared Abstractions

ions ? Benny Yih, Mark Swanson, and Robert Kessler Center for Software Science, Department of Computer Science, University of Utah, Salt Lake City, UT 84112 Abstract. A write-once, read-many persistent store has been developed for Concurrent Scheme, a distributed-memory parallel Lisp for the Mayfly multicomputer. The prototype implementation 2 supports the explicit store and implicit retrieval of instances of the Scheme data types. Items are stored into per node repositories, using a modified form of the original Concurrent Scheme "message" format. Potential access concurrency and transaction atomicity of the store are discussed. The efficacy of the prototype is demonstrated via its utilization within a parallel ray tracer, on a network implementation of Concurrent Scheme. 1 Introduction Historically, the ability to retain data beyond a single program invocation has not been well supported within conventional programming languages. Some languages, such as Lisp and APL, offer this..

Persistent Immutable Shared Abstractions for Concurrent Scheme

technical reportA write-once, read-many persistent store has been developed for Concurrent Scheme, a distributed-memory parallel Lisp for the Mayfly multicomputer. The prototype implementation supports the explicit store, and implicit retrieval, of instances of the Scheme data types. Items are stored into per node repositories, using a modified form of the original Concurrent Scheme "message" format. Potential access concurrency and transaction atomicity of the store are discussed. The efficacy of the prototype is demonstrated via its utilization within a parallel ray tracer, on a network implementation of Concurrent Scheme