Fair Threads

FairThreads offers a very simple framework for concurrent and parallel programming. Basically, it defines schedulers which are synchronization servers, to which fair threads are linked. 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 dynamically linking and unlinking threads.

In the Cooperative variant of FairThreads, all threads are linked to one unique scheduler. Cooperative FairThreads is deterministic and has a precise and clear semantics.

FairThreads is implemented in C; variants of it (basically, Cooperative FairThreads) are also implemented in Java, and Scheme.

There exists 3 implementations of FairThreads:

• Java Implementation
• C Implementation
• Scheme Implementation

The FairThreads mailing list is hosted by sophia.inria.fr. The email address is fairthreads@sophia.inria.fr .

Information requests, subcription/unsubscription to the mailing list must be sent to sympa@lists-sop.inria.fr.

• To subscribe to the mailing list, simply send a message with the words subscribe fairthreads in the Subject: field to the above address. Alternatively you can click the following link: subscribe now
• To unsubscribe to the mailing list, simply send a message with the word unsubscribe fairthreads in the Subject: field to sympa@lists-sop.inria.fr. Alternatively you can click the following link: unsubscribe now
• To get some help with the mailing list, simply send a message with the word HELP in the Subject: field to sympa@lists-sop.inria.fr. Alternatively you can click the following link: help now

It would be helpful to know the reason of your interest in FairThreads. You can send a message to describe it...