1 / 1

Dreadlocks – Deadlock Detection in Linux

Networked Software Lab. Dreadlocks – Deadlock Detection in Linux. Problem definition: Deadlock is a specific condition when two or more processes (or threads) are each waiting for each other to release a resource, thus forming a circular chain. Project g oals:

debra-baldwin
Download Presentation

Dreadlocks – Deadlock Detection in Linux

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Networked Software Lab Dreadlocks – Deadlock Detection in Linux • Problem definition: • Deadlock is a specific condition when two or more processes (or threads) are each waiting for each other to release a resource, thus forming a circular chain. • Project goals: • Supply support for successful debugging • Implement M.Herlihy and E.Koskinen“Dreadlocks” algorithmin Linux. • Evaluate the performance overhead implied by the solution What is Digest? Each thread has a list of processes/threads, it is waiting for in order to acquire a mutex lock . This list is called a digest Deadlock Detection – how it gets done: Thread trying to acquire mutex that is already locked checks the owner’s digest for its TID and if it is found there – DEADLOCK. New lock algorithm : Acquire it alert the user no Try to locka mutex Digest of A:{B} Digest of B:{A} Taken? yes yes try to detect a deadlock Deadlock? no By: Dan Slov & Gal Nave Supervisor: Dimitri Perelman

More Related