A parallel multi-unit resource deadlock detection algorithm with \(O(\log _2(\min (m, n)))\) overall run-time complexity (Q635373)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A parallel multi-unit resource deadlock detection algorithm with \(O(\log _2(\min (m, n)))\) overall run-time complexity |
scientific article; zbMATH DE number 5940542
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel multi-unit resource deadlock detection algorithm with \(O(\log _2(\min (m, n)))\) overall run-time complexity |
scientific article; zbMATH DE number 5940542 |
Statements
A parallel multi-unit resource deadlock detection algorithm with \(O(\log _2(\min (m, n)))\) overall run-time complexity (English)
0 references
19 August 2011
0 references
deadlock detection
0 references
deadlock detection in hardware
0 references
multi-unit resource systems
0 references
chip multiprocessor
0 references
graph traversing
0 references
reachability computation
0 references
parallel algorithm
0 references
digital logic design
0 references
RTOS
0 references
real-time embedded systems
0 references
