ISSN:
1573-0557
Keywords:
continuations
;
stacks
;
heap allocation
;
coroutines
;
multitasking
;
Scheme
;
Smalltalk
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract Scheme and Smalltalk continuations may have unlimited extent. This means that a purely stack-based implementation of continuations, as suffices for most languages, is inadequate. We review several implementation strategies for continuations and compare their performance using instruction counts for the normal case and continuation-intensive synthetic benchmarks for other scenarios, including coroutines and multitasking. All of the strategies constrain a compiler in some way, resulting in indirect costs that are hard to measure directly. We use related measurements on a set of benchmarks to calculate upper bounds for these indirect costs.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1010016816429
Permalink
