By Topic

Optimal deadlock avoidance policy for reentrant work flows

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

1 Author(s)
Fu-Shiung Hsieh ; Overseas Chinese Inst. of Technol., Taiwan

Deadlock is a highly undesirable situation in which a set of parts or jobs are requested or waiting for resources held by other parts or jobs in the same set, with the set of parts or jobs in circular waiting. Although deadlock has attracted considerable attention in the context of automated manufacturing systems, most existing results focus on development of suboptimal deadlock avoidance algorithms to reduce the computational complexity involved. The paper considers a subclass of sequential processes whose optimal deadlock avoidance policy can be found in polynomial time. Our results include: (1)a re-entrant process model (2) analysis for single re-entrant process and (3)examples and extension to multiple work flows

Published in:

Robotics and Automation, 2002. Proceedings. ICRA '02. IEEE International Conference on  (Volume:3 )

Date of Conference:

2002