Scheduler pattern: Difference between revisions

Revision as of 05:59, 14 September 2004

Revision as of 13:45, 20 April 2005

Line 3:

The scheduler pattern uses an object that explicitly sequences waiting threads. It provides a mechanism to implement a [[scheduling policy]], but is independent of any specific scheduling policy — the policy is encapsulated in its own class and is reusable.

The [[Read write lock pattern|read/write lock pattern]] is usually implemented using the scheduler patterpattern to ensure fairness in scheduling.

Note that the scheduler pattern adds significant overhead beyond that required to call a synchronized [[method (computer science)|method]].