JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

List of Experiments:

• 1. Design and implement Two-thread mutual exclusion algorithm (Peterson’s Algorithm) using multithreaded programming.
• 2. Design and implement Filter Lock algorithm and check for deadlock-free and starvation-free conditions using multithreaded programming.
• 3. Design and implement Lamport’s Bakery Algorithm and check for deadlock-free and starvation- free conditions using multithreaded programming.
• 4. Design and implement Lock-based concurrent FIFO queue data structure using multithreaded programming.
• 5. Design a consensus object using read–write registers by implementing a deadlock-free or starvation-free mutual exclusion lock. (Use CompareAndSet( ) Primitive).
• 6. Design and implement concurrent List queue data structure using multithreaded programming. (Use Atomic Primitives)
• 7. Design and implement concurrent Stack queue data structure using multithreaded programming. (Use Atomic Primitives)
• 8. Design and implement concurrent FIFO queue data structure using multithreaded programming. (Use Atomic Primitives) R18 B.TECH CSE III YEAR