Various strategies for implementing adaptive parallelism have already been proposed and studied. In eager scheduling , packets of work to be done are kept in a pool from which worker nodes get any undone work whenever they run out of work to do. In this way, faster workers get more work according to their capability. And, if any work is left undone by a slow node, or a node that ``dies'', it eventually gets reassigned to another worker. Systems that implement eager schedule include Charlotte  and the factoring demo used in Sect.4.3.
The Linda model  provides an associative tuple-space that can be used to store both data and tasks to be done. Since this tuple-space is global and optionally blocking, it can be used both for communication and synchronization between parallel tasks. It can also serve as a work pool, which like in eager scheduling, can allow undone tasks to be redone. Linda was originally used in the Piranha  system, and more recently implemented in Java by WWWinda , Jada , and Javelin .
In Cilk , a task running on a node, A, can spawn a child task, which the node then executes. If another node, B, runs out of work while NodeA is still running the child task, it can steal the parent task from NodeA and continue to execute it. This work-stealing algorithm has been shown to be provably efficient and fault-tolerant. Cilk has been implemented for NOWs , and has been implemented using Java applications (but not applets) in ATLAS .
Project Bayanihan aims to develop a framework that does not limit the programmer to using only one form of adaptive parallelism, but instead makes it easy to implement any of these forms and even develop new ones.