The Community for Technology Leaders
Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on (1997)
Aizu-Wakamatsu, Fukushima, JAPAN
Mar. 17, 1997 to Mar. 21, 1997
ISBN: 0-8186-7870-4
pp: 233
Ju Gyun Kim , Sookmyung Women's University
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 structure, 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.
INDEX TERMS
CITATION
Ju Gyun Kim, "An Algorithmic Approach on Deadlock Detection for Enhanced Parallelism in Multiprocessing Systems", Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on, vol. 00, no. , pp. 233, 1997, doi:10.1109/AISPAS.1997.581669
81 ms
(Ver 3.3 (11022016))