A language-based approach to unifying events and threads Export

@article{citeulike:675012, abstract = {This paper presents a language-based technique to unify two seemingly opposite programming models for building massively concurrent network services: the eventdriven model and the multithreaded model. The result is a unified concurrency model providing both thread abstractions and event abstractions. Using this model, each component in an application can be implemented using the appropriate abstraction, simplifying the design of complex, multithreaded systems software. This paper shows how to implement the unified concurrency model in Haskell, a pure, lazy, functional programming language. It also demonstrates how to use these techniques to build an application-level thread library with support formultiprocessing and asynchronous I/O mechanisms in Linux. The thread library is typesafe, is relatively simple to implement, and has good performance. Application-level threads are extremely lightweight (scaling to ten million threads) and our scheduler, which is implemented as a modular and extensible event-driven system, outperforms NPTL in I/O benchmarks.}, author = {Li, Peng and Zdancewic, Steve}, citeulike-article-id = {675012}, citeulike-linkout-0 = {http://www.cis.upenn.edu/~lipeng/papers/lz06submitted.pdf}, keywords = {concurrency, continuations, events, haskell}, posted-at = {2006-05-30 15:35:42}, priority = {0}, title = {A language-based approach to unifying events and threads}, url = {http://www.cis.upenn.edu/~lipeng/papers/lz06submitted.pdf} }

TY - JOUR ID - citeulike:675012 L3 - citeulike-article-id:675012 N2 - This paper presents a language-based technique to unify two seemingly opposite programming models for building massively concurrent network services: the eventdriven model and the multithreaded model. The result is a unified concurrency model providing both thread abstractions and event abstractions. Using this model, each component in an application can be implemented using the appropriate abstraction, simplifying the design of complex, multithreaded systems software. This paper shows how to implement the unified concurrency model in Haskell, a pure, lazy, functional programming language. It also demonstrates how to use these techniques to build an application-level thread library with support formultiprocessing and asynchronous I/O mechanisms in Linux. The thread library is typesafe, is relatively simple to implement, and has good performance. Application-level threads are extremely lightweight (scaling to ten million threads) and our scheduler, which is implemented as a modular and extensible event-driven system, outperforms NPTL in I/O benchmarks. TI - A language-based approach to unifying events and threads KW - concurrency KW - continuations KW - events KW - haskell AU - Li, Peng AU - Zdancewic, Steve UR - http://www.cis.upenn.edu/~lipeng/papers/lz06submitted.pdf ER -