Pages that link to "Item:Q1285615"
From MaRDI portal
The following pages link to Time efficient deadlock resolution algorithms (Q1285615):
Displaying 8 items.
- A parallel multi-unit resource deadlock detection algorithm with \(O(\log _2(\min (m, n)))\) overall run-time complexity (Q635373) (← links)
- Deadlock avoidance with a modified banker's algorithm (Q1091127) (← links)
- Resolution of process collisions in the scalable computer systems (Q1778897) (← links)
- Fast decentralized algorithms for resolving conflicts and deadlocks in resource allocation in data processing and control systems (Q1956921) (← links)
- On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem (Q2078619) (← links)
- Deadlock resolution in wait-for graphs by vertex/arc deletion (Q2420655) (← links)
- An Automatic Approach to Deadlock Detection and Resolution in Discrete Simulation Systems (Q4354942) (← links)
- Automata, Languages and Programming (Q5716833) (← links)