2008
DOI: 10.1007/978-3-540-89247-2_7
|View full text |Cite
|
Sign up to set email alerts
|

Deadlocks: From Exhibiting to Healing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
26
0

Year Published

2010
2010
2019
2019

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 39 publications
(27 citation statements)
references
References 13 publications
1
26
0
Order By: Relevance
“…Deadlock immunity approaches include [5,9]. These approaches dynamically detect deadlocks, then avoid future occurrences of the same deadlocks.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…Deadlock immunity approaches include [5,9]. These approaches dynamically detect deadlocks, then avoid future occurrences of the same deadlocks.…”
Section: Related Workmentioning
confidence: 99%
“…If a deadlock involving threads t 1 and t 2 and locks l 1 and l 2 occurs, the two approaches save the program positions p 1 and p 2 (where l 1 and l 2 were acquired) into the signature of the deadlock; [9] saves, in addition, the positions p ′ 1 and p ′ 2 where t 1 and t 2 deadlocked. In future runs, [5,9] prevent the deadlock from reoccurring by acquiring a "gate lock" every time the lock statement at p 1 or p 2 is about to execute. If the lock at p ′ 1 (or p ′ 2 ) can be soundly inferred at runtime from p 1 (respectively p 2 ), [9] swaps the lock acquisitions at p 1 and p ′ 1 (respectively p 2 and p ′ 2 ), instead of acquiring a gate lock.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…There are tools that provide immunity against failures like deadlocks [1], [2], data races and atomicity violations [3], [4], [5], and buffer overruns [6]; however, to the best of our knowledge, Android Dimmunix is (1) the first system that provides platform-wide failure immunity, and (2) the first system providing failure immunity to mobile phone applications.…”
Section: Introductionmentioning
confidence: 99%
“…The method in [7] generates a scheduler (from deadlock potentials) that attempts to drive the application into a deadlock. Finally, the work in [8] involves the informing of a scheduling Bnoise maker[ of deadlock potentials. The noise maker inserts code that influences the scheduler, avoiding the need for a special scheduler.…”
Section: Introductionmentioning
confidence: 99%