Routines for implementing sychronous threads (aka cooperative multitasking)
Cheap Threads is a collection of routines for implementing synchronous threads. It includes a scheduler and a facility for passing messages among threads. Threads may run in a round robin or according to a priority scheme. Each thread must voluntarily relinquish control from time, via an ordinary function return, so that other threads can run. Since the threads are synchronous, i.e. they don't interrupt each other, they don't need to use semaphores, mutexes, critical sections, or other facilities to keep from interfering with each other. One version of Cheap Threads is designed for embedded systems.
DocumentationUser manual included and available in HTML format from http://home.swbell.net/mck9/ct/#toc; User tutorial available in HTML format from http://home.swbell.net/mck9/ct/tutor_1.html
released on 17 May 2005
|License||Verified by||Verified on||Notes|
|LGPL||Janet Casey||12 August 2002|
Leaders and contributors
Resources and communication
This entry (in part or in whole) was last reviewed on 7 January 2008.
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.
The copyright and license notices on this page only apply to the text on this page. Any software or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.