Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Designing maximally permissive deadlock avoidance policies for sequential resource allocation systems through classification theory

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Nazeem, A. ; Sch. of Ind. & Syst. Eng., Georgia Inst. of Technol., Atlanta, GA, USA ; Reveliotis, S.A.

Most of the past research on the problem of deadlock avoidance for sequential resource allocation systems (RAS) has acknowledged the fact that the maximally permissive deadlock avoidance policy (DAP) possesses super-polynomial complexity for most RAS classes, and it has resorted to solutions that trade off maximal permissiveness for computational tractability. In this work, we seek the effective implementation of the maximally permissive DAP for sequential RAS, by distinguishing between the off-line and the on-line computation required for the specification of this policy, and developing a representation of the derived result that will require minimal on-line computation. The particular representation that we adopt is that of a compact classifier that will effect the underlying dichotomy of the reachable state space into safe and unsafe subspaces. The reported results establish that the proposed method can support the effective deployment of maximally permissive DAP for RAS with very large state spaces.

Published in:

Automation Science and Engineering (CASE), 2011 IEEE Conference on

Date of Conference:

24-27 Aug. 2011