Two Types of Deadlock Detection: Cyclic and Acyclic

Shimomura, Takao; Ikeda, Kenji

doi:10.1007/978-3-319-04702-7_14

Cited by 3 publications

(2 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We can identify two types of deadlock scenarios: cyclic deadlocks and acyclic deadlocks, that differ in the nature of the resource locked between the processes involved [44]. Cyclic deadlocks represent a category of deadlock in which the resources that are locked in place exhibit a circular dependency.…”

Section: B Deadlock Prevention Policymentioning

confidence: 99%

Hierarchical Traffic Management of Multi-AGV Systems With Deadlock Prevention Applied to Industrial Environments

Pratissoli

Brugioni²,

Battilani³

2024

IEEE Trans. Automat. Sci. Eng.

View full text Add to dashboard Cite

Section: B Deadlock Prevention Policymentioning

confidence: 99%

Hierarchical Traffic Management of Multi-AGV Systems With Deadlock Prevention Applied to Industrial Environments

Pratissoli

Brugioni²,

Battilani³

2024

IEEE Trans. Automat. Sci. Eng.

View full text Add to dashboard Cite

“…We note that all tools cannot avoid bug#9. As shown in Figure 7, this bug actually is an acyclic deadlock [49]. Each thread is waiting on a condvar, but there are no threads to send signals onto these condvars; thus, each thread will wait forever.…”

Section: Effectiveness On Avoiding Deadlocksmentioning

confidence: 99%

Concurrency Bug Avoiding Based on Optimized Software Transactional Memory

Zuo

Xiong

2019

Scientific Programming

View full text Add to dashboard Cite

Software transactional memory is an effective mechanism to avoid concurrency bugs in multithreaded programs. However, two problems hinder the adoption of such traditional systems in the wild world: high human cost for equipping programs with transaction functionality and low compatibility with I/O calls and conditional variables. This paper presents Convoider to solve these problems. By intercepting interthread operations and designating code among them as transactions in each thread, Convoider automatically transactionalizes target programs without any source code modification and recompiling. By saving/restoring stack frames and CPU registers on beginning/aborting a transaction, Convoider makes execution flow revocable. By turning threads into processes, leveraging virtual memory protection and customizing memory allocation/deallocation, Convoider makes memory manipulations revocable. By maintaining virtual file systems and redirecting I/O operations onto them, Convoider makes I/O effects revocable. By converting lock/unlock operations to no-ops, customizing signal/wait operations on condition variables, and committing memory changes transactionally, Convoider makes deadlocks, data races, and atomicity violations impossible. Experimental results show that Convoider succeeds in transparently transactionalizing twelve real-world applications with averagely incurring only 28% runtime overhead and perfectly avoid 94% of thirty-one concurrency bugs used in our experiments. This study can help efficiently transactionalize legacy multithreaded applications and effectively improve the runtime reliability of them.

show abstract

Slider: an online and active deadlock avoider by serial execution of critical sections

2016

IJHPSA

View full text Add to dashboard Cite

Two Types of Deadlock Detection: Cyclic and Acyclic

Cited by 3 publications

References 30 publications

Hierarchical Traffic Management of Multi-AGV Systems With Deadlock Prevention Applied to Industrial Environments

Hierarchical Traffic Management of Multi-AGV Systems With Deadlock Prevention Applied to Industrial Environments

Concurrency Bug Avoiding Based on Optimized Software Transactional Memory

Slider: an online and active deadlock avoider by serial execution of critical sections

Contact Info

Product

Resources

About