Menu
Home Explore People Places Arts History Plants & Animals Science Life & Culture Technology
On this page
Engine (computer science)
Programming construct providing timed preemption

An engine is a continuation-based construct that provides timed preemption. Engines which can contain other engines are sometimes called Nesters and engines which do not have this ability are then called flat engines or "solo engines". To implement timed preemption there needs to be a clock. This clock can measure real time or simulated time. Simulated time can be implemented in a language like Scheme, by making each function start with decrementing the clock.

(define-syntax timed-lambda ((_ formals exp1 exp2 ...) (lambda formals (decrement-timer) exp1 exp2 ...))))
We don't have any images related to Engine (computer science) yet.
We don't have any YouTube videos related to Engine (computer science) yet.
We don't have any PDF documents related to Engine (computer science) yet.
We don't have any Books related to Engine (computer science) yet.
We don't have any archived web articles related to Engine (computer science) yet.

References

  1. Dybvig, R. Kent; Hieb, Robert (July 21, 1988). "Engines from Continuations" (PDF). Indiana University - Computer Science Department. https://legacy.cs.indiana.edu/~dyb/pubs/engines.pdf

  2. Haynes, Christopher T.; Friedman, Daniel P. (1987-01-01). "Abstracting timed preemption with engines". Computer Languages. 12 (2): 109–121. doi:10.1016/0096-0551(87)90003-8. https://dl.acm.org/doi/10.1016/0096-0551%2887%2990003-8