Title :
An algorithmic approach on deadlock detection for enhanced parallelism in multiprocessing systems
Author_Institution :
Dept. of Comput. Sci., SMWU, Seoul, South Korea
Abstract :
This paper presents a non-blocking deadlock detection scheme with immediate knot detection in multiprocessing systems. We assume an expedient state and a special case where each request is limited to one resource unit at a time. Unlike the previous deadlock detection schemes, this new method, using some different data structures takes O(1) time for detecting a knot and O(nm) time for blocking or handling resource release where n and m are the number of processes and that of resources in the system. The deadlock detection latency is thus minimized and is constant regardless of n and m. However, in a multiprocessing system, the operating system can handle the blocking or release on-the-fly running on a separate processor, thus not interfering with user process execution. To some applications where deadlock is concerned, a predictable and zero-latency deadlock detection scheme could be very useful
Keywords :
concurrency control; multiprocessing systems; parallel architectures; deadlock; deadlock detection; enhanced parallelism; knot detection; multiprocessing systems; non-blocking deadlock detection; zero-latency deadlock detection; Computer science; Data structures; Delay; Detection algorithms; Multiprocessing systems; Operating systems; Parallel processing; Resource management; Sufficient conditions; System recovery;
Conference_Titel :
Parallel Algorithms/Architecture Synthesis, 1997. Proceedings., Second Aizu International Symposium
Conference_Location :
Aizu-Wakamatsu
Print_ISBN :
0-8186-7870-4
DOI :
10.1109/AISPAS.1997.581669