An o ( min ( m , n )) parallel deadlock detection algorithm

Autor:	Vincent J. Mooney, Jaehwan John Lee
Rok vydání:	2005
Předmět:	Correctness Computer science business.industry Real-time computing Initialization Parallel computing Deadlock Computer Graphics and Computer-Aided Design Software implementation Computer Science Applications Software Electrical and Electronic Engineering business Deadlock prevention algorithms
Zdroj:	ACM Transactions on Design Automation of Electronic Systems. 10:573-586
ISSN:	1557-7309 1084-4309
DOI:	10.1145/1080334.1080341
Popis:	This article presents a novel Parallel Deadlock Detection Algorithm (PDDA) and its hardware implementation, Deadlock Detection Unit (DDU). PDDA uses simple Boolean representations of request, grant, and no activity so that the hardware implementation of PDDA becomes easier and operates faster. We prove the correctness of PDDA and that the DDU has a runtime complexity of O ( min ( m , n )), where m is the number of resources and n is the number of processes. The DDU reduces deadlock detection time by 99%, (i.e., 100X) or more compared to software implementations of deadlock detection algorithms. An experiment involving a practical situation with an early deadlock condition showed that the time measured from application initialization to deadlock detection was reduced by 46% by employing the DDU as compared to detecting deadlock in software.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::e345d8350f087f33a44205465754f1fe https://doi.org/10.1145/1080334.1080341 Zobrazit plný text záznamu