Changes for page Deadlock Prevention
Last modified by chrisby on 2023/11/28 19:17
Summary
-
Page properties (1 modified, 0 added, 0 removed)
Details
- Page properties
-
- Content
-
... ... @@ -1,11 +1,11 @@ 1 1 Deadlocks can only occur if all four specific conditions are met. Therefore, strategies to prevent deadlocks focus on negating one of these conditions. 2 2 3 -| ------------------------ | ---------------------------------------------------------------------------------------- --------------------------------------------------------------------| ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|4 -| **Condition** | 5 -| Mutual Exclusion / Mutex | 1)UseconcurrentlyaccessibleresourceslikeAtomicInteger.2)Increasethenumberofresourcesuntilits greater or equal to the number of competing threads. 3 ) Check if every required resource is accessible before the task starts.|6 -| Lock&Wait|Onceathreadacquiresaresource,itwillnot release the resource until it has acquired all of the other resources it requires and has completed its work.|Beforereservationofaresource,checkitsaccessibility.Ifaresourceisnotaccessible,releaseeveryresourceandstartfromanew.Starvation:Athreadneverachievestoreserveallrequiredresources.Livelock:Threadgets tangled up. These two approach are always applicable but inefficient as it causes a bad performance.|7 -| | 8 -| | 3 +| ------------------------ | ---------------------------------------------------------------------------------------- | ------------- | ----------- | 4 +| **Condition** | **Description** | **Solutions** | **Dangers** | 5 +| Mutual Exclusion / Mutex | When resources can't be used by mutual thread and there are less resources than threads. | | | 6 +| | | | | 7 +| | | | | 8 +| | | | | 9 9 10 10 #### Lock & Wait 11 11