| 11. | Ada also offers " protected objects " for mutual exclusion.
|
| 12. | The "'Suzuki-Kasami algorithm "'is a token-based algorithm for achieving mutual exclusion in distributed systems.
|
| 13. | Having concurrency with monitors to solve the mutual exclusion problem.
|
| 14. | In other words, we need a way to execute a critical section with mutual exclusion.
|
| 15. | Modern operating systems provide mutual exclusion primitives that are more general and flexible than Dekker's algorithm.
|
| 16. | Threads had access to a single kind of mutual exclusion primitive, and one of seven priorities.
|
| 17. | Dekker's algorithm is the first known correct solution to the mutual exclusion problem in concurrent programming.
|
| 18. | In some forms of mutual exclusion only one event can ever occur, whether collectively exhaustive or not.
|
| 19. | The mutual exclusion primitive could be ported to any architecture with an atomic test and set instruction.
|
| 20. | This allows one to design algorithms for mutual exclusion, and tasks like debugging or optimising distributed systems.
|
