Definitions and Detection of Deadlock, Livelock, and Starvation in Concurrent Programs

Authors:
Kuo-Chung Tai
Affiliations:
North Carolina State University, USA
Venue:
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 02
Year:
1994

Citing 0
Cited 3

VP: a new operation for semaphores

ACM SIGOPS Operating Systems Review
Static detection of Livelocks in Ada multitasking programs

Ada-Europe'07 Proceedings of the 12th international conference on Reliable software technologies
Use of TTCN-3 for software module testing

TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Deadlock, livelock, starvation, and other terms have been used to describe undesirable situations involving blocking or not making progress for processes in a concurrent program However, definitions of these terms are inconsistent and often informal This paper provides formal definitions of deadlock, livelock, and starvation in terms of the reachability graph of a concurrent program Also, this paper shows algorithms for the detection of deadlock, livelock, and starvation.