IONS 3.1 Scheme 48 Kali Scheme is implemented as an extension to Scheme 48 [Kelsey and Rees 1994], an implementation of Scheme [Clinger and Rees 1991]. Scheme is a lexically scoped dialect of Lisp. Scheme 48 is based on as byte-coded interpreter written in a highly optimized, restricted dialect of Scheme called Pre-Scheme, which compiles to C. Because of the way it is implemented, the system is very portable and is reasonably efficient for an interpreted system. 2 Unlike other Scheme implementations, 2 Scheme 48 is roughly 10-15 times slower slower than a highly optimized Scheme compiler generating native code [Kranz et al. 1986]. (define-record-type thread : : : continuation : : : ) (define current-thread : : : ) (define (spawn thunk) (let ((thread (make-thread))) (set-thread-continuation! thread (lambda (ignore) (thunk) (terminate-current-thread))) (context-switch thread))) (define (context-switch thread) (add-to-queue! runnable-threads current-thread) (switch-to-thread thre...
|
2701
|
Communication and Concurrency
– Milner
- 1989
|
|
1415
|
The Definition of Standard ML
– Milner, Tofte, et al.
- 1990
|
|
843
|
Implementing remote procedure calls
– Birrell, Nelson
- 1984
|
|
829
|
Memory coherence in shared virtual memory systems
– Li, Hudak
- 1989
|
|
693
|
PVM: a framework for parallel distributed computing
– Sunderam
- 1990
|
|
380
|
A Language with Distributed Scope
– Cardelli
- 1995
|
|
199
|
I-structures: data structures for parallel computing
– ARVIND, S, et al.
- 1989
|
|
197
|
CML: A Higher-Order Concurrent Language
– Reppy
- 1991
|
|
191
|
Orbit: An optimizing compiler for Scheme
– Kranz, Kelsey, et al.
- 1986
|
|
190
|
How to write parallel programs: A guide to the perplexed
– Carriero, Gelernter
- 1989
|
|
159
|
Facile: A symmetric integration of concurrent and functional programming
– Giacalone, Mishra, et al.
- 1989
|
|
157
|
The revised report on the algorithmic language Scheme
– Clinger, Rees
- 1991
|
|
139
|
Parallel programming in Split-C
– CULLER, ARPACI-DUSSEAU, et al.
- 1993
|
|
132
|
Network objects
– Birrell, Nelson, et al.
- 1993
|
|
108
|
Distributed Systems
– Mullender
- 1993
|
|
94
|
A practical soft type system for scheme
– Wright, Cartwright
- 1997
|
|
87
|
Integrating message-passing and shared-memory: Early experience
– Kranz, Johnson, et al.
- 1993
|
|
79
|
Process Migration in DEMOS/MP
– Powell, Miller
- 1983
|
|
72
|
Garbage collecting the world
– Lang, Queinnec, et al.
- 1992
|
|
69
|
Software versus hardware shared-memory implementation: A case study
– Cox, Dwarkadas, et al.
- 1994
|
|
54
|
A tractable Scheme implementation
– Kelsey, Rees
- 1995
|
|
48
|
Effective flow analysis for avoiding runtime checks
– Jagannathan, Wright
- 1995
|
|
43
|
Computation migration: Enhancing locality for distributed-memory parallel systems
– Hsieh, Wang, et al.
- 1993
|
|
36
|
Cache performance of garbage-collected programs
– Reinhold
|
|
34
|
Distributed Garbage Collection for Network Objects
– Birrell, Evers, et al.
- 1993
|
|
29
|
Embedding Continuations in Procedural Objects
– Haynes, Friedman
- 1987
|
|
28
|
A foundation for an efficient multi-threaded scheme system
– Jagannathan, Philbin
- 1992
|
|
28
|
The Java Language Specification
– Microsystems
- 1995
|
|
24
|
Scalable distributed garbage collection for systems of active objects
– Venkatasubramanian, Agha, et al.
- 1992
|
|
20
|
Piranha scheduling: Strategies and their implementation
– Gelernter, Jourdenais, et al.
- 1993
|
|
12
|
Performance of firefly rpc
– Schroder, Burrows
- 1990
|
|
9
|
Procs and Locks: a portable multiprocessing platform for standard ML of New Jersey
– Morrisett, Tolmach
- 1993
|
|
3
|
Tail-recursive stack disciplines for an interpreter
– Kelsey
- 1992
|
|
2
|
Efficient parallel garbage collection on massively parallel computers
– Kamada, Matsuoka, et al.
- 1994
|
|
1
|
Mudding: Social phenonmena in text-based virtual realities
– Curtis
- 1992
|
