Scheme fair threads

@inproceedings{Serrano2004SchemeFT,
  title={Scheme fair threads},
  author={M. Serrano and F. Boussinot and Bernard P. Serpette},
  booktitle={PPDP '04},
  year={2004}
}
This paper presents Fair Threads, a new model for concurrent programming. This multi-threading model combines preemptive and cooperative scheduling. User threads execute according to a cooperative strategy. Service threads execute according to a preemptive strategy. User threads may ask services from service threads in order to improve performance by exploiting hardware parallelism and in order to execute non-blocking operations.Fair threads are experimented within the context of the functional… Expand
Debugging Scheme Fair Threads
Cooperative Threads and Preemptive Computations
Formalisation of FunLoft
Continuation-passing for C: a space-efficient implementation of concurrency
Fair Cooperative Multithreading
Integrating Remote Invocations with Asynchronism and Cooperative Multitasking
Typing termination in a higher-order concurrent imperative language
The SL synchronous language, revisited
  • R. Amadio
  • Computer Science
  • J. Log. Algebraic Methods Program.
  • 2007
Exceptional Continuations in JavaScript
...
1
2
3
4
...