This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Parallel Deadlock Detection Algorithm with O(1) Overall Run-time Complexity
July-December 2008 (vol. 7 no. 2)
pp. 45-48
Jaehwan Lee, IUPUI, Indianapolis
Xiang Xiao, IUPUI, Indianapolis
This article proposes a novel parallel, hardware-oriented deadlock detection algorithm for multiprocessor system-on-chips. The proposed algorithm takes full advantage of hardware parallelism in computation and maintains information needed by deadlock detection through classifying all resource allocation events and performing class specific operations, which together make the overall run-time complexity of the new method O(1). We implement the proposed algorithm in Verilog HDL and demonstrate in the simulation that each algorithm invocation takes at most four clock cycles in hardware.
Index Terms:
Deadlocks, Algorithms implemented in hardware, Real-time and embedded systems
Citation:
Jaehwan Lee, Xiang Xiao, "A Parallel Deadlock Detection Algorithm with O(1) Overall Run-time Complexity," IEEE Computer Architecture Letters, vol. 7, no. 2, pp. 45-48, July-Dec. 2008, doi:10.1109/L-CA.2008.4
Usage of this product signifies your acceptance of the Terms of Use.