Revisiting deadlock prevention: a probabilistic approach

Details Revisiting deadlock prevention: a probabilistic approach Revisiting deadlock prevention: a probabilistic approach

2010-10-21

arxiv.org/abs/1010.4411v1

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

We revisit the deadlock-prevention problem by focusing on priority digraphs instead of the traditional wait-for digraphs. This has allowed us to formulate deadlock prevention in terms of prohibiting the occurrence of directed cycles even in the most general of wait models (the so-called AND-OR model, in which prohibiting wait-for directed cycles is generally overly restrictive). For a particular case in which the priority digraphs are somewhat simplified, we introduce a Las Vegas probabilistic mechanism for resource granting and analyze its key aspects in detail.

Affiliated with

Also associated with

No associations

Rating

Revisiting deadlock prevention: a probabilistic approach does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Revisiting deadlock prevention: a probabilistic approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Revisiting deadlock prevention: a probabilistic approach will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-423198