How Can One Ensure Mutual Exclusion Without Locks?

1.	How Can One Ensure Mutual Exclusion Without Locks?
Answer» When references of two (or more) threads (or PROCESSES) may be serialized with respect to a variable, system primitives LIKE compare and swap can help detect the conflict with ANOTHER thread. Lock free implementations of a thread USUALLY detect the conflict atomically (e.g., using compare and swap) and one succeeds while the other BACKS off and retries. When references of two (or more) threads (or processes) may be serialized with respect to a variable, system primitives like compare and swap can help detect the conflict with another thread. Lock free implementations of a thread usually detect the conflict atomically (e.g., using compare and swap) and one succeeds while the other backs off and retries.

Answer»

When references of two (or more) threads (or PROCESSES) may be serialized with respect to a variable, system primitives LIKE compare and swap can help detect the conflict with ANOTHER thread. Lock free implementations of a thread USUALLY detect the conflict atomically (e.g., using compare and swap) and one succeeds while the other BACKS off and retries.

When references of two (or more) threads (or processes) may be serialized with respect to a variable, system primitives like compare and swap can help detect the conflict with another thread. Lock free implementations of a thread usually detect the conflict atomically (e.g., using compare and swap) and one succeeds while the other backs off and retries.

Discussion

No Comment Found

Related InterviewSolutions

How Long Does The Parallel Version Of Prim’s Minimum Spanning Tree Finding Algorithm Require For A Graph With N Nodes Using P Processors?
How Can One Ensure Mutual Exclusion Without Locks?
When Stealing Load From A Random Loaded Processor, What Type Of Synchronization Is Needed?
How Fast Can A List Be Sorted Using N Processors Using Local Sorting Of N/p Elements Each Followed By Optimal Multi-way Merge?
How Fast Can Two Sorted Lists Of Size N Each Be Merged Into One Using P Processors?
In Order To Balance Load For Parallel Bucket Sort Of N Elements, Uniformly Spaced Splitters Need To Be Selected. This Can Be Done By First Dividing The List Into B Lists And Choosing B Equi-spaced Samples From Each. The Final B Splitters Are Chosen Uniformly Spaced From These Samples. How Balanced Are The Buckets If These Splitters Are Used?
How Long Does Batcher’s Odd-even Merge Require?
How Long Does Bitonic Sorting Require On Pram?
How Can Prefix Minima Be Found In O(1) Time?
How Can Two Gpu Threads Communicate Through Shared Memory?