Cheap Threads 2.6

Cheap Threads provides an alternative -- a library of routines, written in portable Standard C, for running multiple concurrent tasks within a single process.
Each task must be designed to give up control voluntarily from time to time, either by returning from a function call or by using a built-in setjmp/longjmp mechanism. Cheap Threads then runs the next task, until that one yields control. And so on.
Tasks may communicate with each other by sending messages. Since they all run in the same memory space, they may also communicate through shared memory. Since they don't interrupt each other, they don't need to use semaphores, mutexes, or critical sections to keep from stepping on each other.
Depending on how you use it, Cheap Threads can schedule your tasks in a simple round robin scheme, or it can run some tasks more often than others according to their assigned priorites.
A thread can sleep while it awaits a message, so that it doesn't slow down the scheduler for nothing.
Finally, Cheap Threads is open software. You can see how it works, you can change it, you can fix it if it's broken.
Nevertheless, Cheap Threads has its drawbacks. Because each task must give up control from time to time, you may have to structure the code in a way that doesn't feel natural or intuitive.
The scheduler is vulnerable to a task that takes too much time or gets caught in an endless loop. It's up to you to judge the tradeoffs.

Не определены

Ограничения не определены

Специальные требования не определены

История изменений пуста