Szymański's algorithm: Difference between revisions
Content added Content deleted
m (→{{header|Julia}}: n not used) |
m (typo in text) |
||
| Line 5: | Line 5: | ||
The algorithm allows mutiple processes or tasks to access a serial resource without conflict, using only linear waiting times. |
The algorithm allows mutiple processes or tasks to access a serial resource without conflict, using only linear waiting times. |
||
It has application in multitasking and communications, especially if there is a need for massive parallelism with limited |
It has application in multitasking and communications, especially if there is a need for massive parallelism with limited |
||
waiting times for access to resources by the parallel program's components. |
|||
;Task |
;Task |
||