Abstract

Two strategies for supporting asynchronous interrupts are: the use of the processor's hardware interrupt system and the use of polling. The advantages of polling include: portability, simplicity, and low cost for handling interrupts. Unfortunately, polling has an overhead for the explicit interrupt checks inserted in the code. This paper describes balanced polling , a method for placing the interrupt checks which has a low overhead and also guarantees an upper bound on interrupt latency. This method has been used by Gambit (an optimizing native code compiler for Scheme) to support a number of features including multiprocessing and stack overflow detection. The overhead of balanced polling is less than for call-return polling which places interrupt checks at every procedure entry and exit. The overhead of call-return polling is typically 70% larger (but sometimes over 400% larger) than the overhead of balanced polling. 1 Introduction In this paper, the term interrupt is defined as an ...

Citations

595	Compiling with Continuations - Appel - 1992
409	Multilisp: A language for concurrent symbolic computation - Halstead - 1985
234	A Real-Time Garbage Collector Based on the Lifetime of Objects - Lieberman, Hewitt - 1983
202	List processing in real time on a serial computer - Baker - 1978
190	ORBIT: An optimizing compiler for Scheme - KRANZ, KELSEY, et al. - 1986
100	Performance and Evaluation of Lisp Systems - Gabriel - 1985
35	personal communication - White
27	An Efficient and General Implementation of Futures on Large Scale Shared-Memory Multiprocessors - Feeley - 1993
15	A parallel virtual machine for efficient scheme compilation - Feeley, Miller - 1990
13	Trap Architectures for Lisp Systems - Johnson - 1990
5	an Algol-like compiler for Scheme - Liar - 1984
4	Allocation without locking - Appel - 1989
3	Implementing a Scheme-based parallel processing system - Miller - 1988