F. Boussinot EMP-CMA/INRIA - MIMOSA Project 2004 route des Lucioles - BP 93 F-06902 Sophia Antipolis, Cedex Frederic.Boussinot@sophia.inria.fr |
1. Introduction 2. Rationale 3. API Overview 4. API 5. Examples 6. Related Work 7. Conclusion 8. Man Pages |
FairThreads offers a very simple framework for concurrent and parallel programming. Basically, it defines schedulers which are synchronization servers, to which threads can dynamically link or unlink. All threads linked to the same scheduler are executed in a cooperative way, at the same pace, and they can synchronize and communicate using broadcast events. Threads which are not linked to any scheduler are executed by the OS in a preemptive way, at their own pace. FairThreads offers programming constructs for linking and unlinking threads. FairThreads is fully compatible with the standard Pthreads library and has a precise and clear semantics for its cooperative part; in particular, systems exclusively made of threads linked to one unique scheduler are actually completely deterministic. Special threads, called automata, are provided for short-lived small tasks or when a large number of tasks is needed. Automata do not need the full power of a native thread to execute and thus consume less resources.
[5] Next Generation POSIX Threading Web Site. [6] Reactive Programming Web Site. [7] Boussinot, F. -- Java Fair Threads -- Inria research report, RR-4139, 2001. [13] Hollub, A. -- Taming Java Threads -- Apress, 2000. [17] Nichols, B. and Buttlar, D. and Proulx Farrell J. -- Pthreads Programming -- O'Reilly, 1996. [18] Reppy, John H. -- Concurrent Programming in ML -- Cambridge University Press, 1999. |