Sciweavers

CAL
2008

A Parallel Deadlock Detection Algorithm with O(1) Overall Run-time Complexity

13 years 3 months ago
A Parallel Deadlock Detection Algorithm with O(1) Overall Run-time Complexity
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.
Jaehwan John Lee, Xiang Xiao
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where CAL
Authors Jaehwan John Lee, Xiang Xiao
Comments (0)