| Publication Type |
technical report |
| School or College |
College of Engineering |
| Department |
Computing, School of |
| Creator |
Yih, Benny C. |
| Title |
Persistent Immutable Shared Abstractions for Concurrent Scheme |
| Date |
1994 |
| Description |
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 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. |
| Type |
Text |
| Subject |
concurrent scheme; lisp, mayfly; multicomputer; persistent store; ray tracer |
| Subject LCSH |
Electronic data processing--Distributed processing |
| Language |
eng |
| Bibliographic Citation |
Yih, B. C. (1994). Persistent Immutable Shared Abstractions for Concurrent Scheme. |
| Series |
University of Utah Computer Science Technical Report |
| Relation is Part of |
ARPANET |
| Format Medium |
application/pdf |
| Format Extent |
48,042,973 bytes |
| File Name |
Yih-Persistent_Immutable.pdf |
| Conversion Specifications |
Original scanned with Kirtas 2400 and saved as 400 ppi uncompressed TIFF. PDF generated by Adobe Acrobat Pro X for CONTENTdm display |
| ARK |
ark:/87278/s63z07x3 |
| Setname |
ir_computersa |
| ID |
103245 |
| Reference URL |
https://collections.lib.utah.edu/ark:/87278/s63z07x3 |
