NDLI: Algebraic deadlock avoidance policies for conjunctive/disjunctive resource allocation systems

Content Provider	IEEE Xplore Digital Library
Author	Jonghun Park Reveliotis, S.A.
Copyright Year	2001
Description	Author affiliation: Sch. of Ind. & Syst. Eng., Georgia Inst. of Technol., Atlanta, GA, USA (Jonghun Park)
Abstract	Operational flexibility of deadlock avoidance policies (DAPs) is an essential requirement for achieving high resource utilization of the underlying deadlock-prone resource allocation system. The paper presents computational methods for synthesizing highly flexible DAPs for the class of conjunctive/disjunctive resource allocation systems (CD-RAS), which generalizes the resource allocation model that has been typically studied in the past, by allowing multiple resource acquisitions and flexible routings. Specifically, a linear programming method to compute DAPs for CD-RAS is developed, and subsequently a series of computational tools are provided to enhance the policy permissiveness/flexibility. These methods are based on: (i) the pertinent exploitation of the policy parameterization, (ii) the observation that the considered class of policies is closed under policy disjunctions, and (iii) the systematic relaxation of the policy-imposed constraints through Petri net structural analysis. The presented results are demonstrated through an example modeling an agile automation system.
Sponsorship	IEEE Robotics & Autom. Soc
Starting Page	70
Ending Page	76
File Size	1088574
Page Count	7
File Format	PDF
ISBN	0780365763
ISSN	10504729
DOI	10.1109/ROBOT.2001.932532
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2001-05-21
Publisher Place	South Korea
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	System recovery Resource management Digital audio players Routing Polynomials Taxonomy Systems engineering and theory Linear programming Automation Discrete event systems
Content Type	Text
Resource Type	Article
Subject	Artificial Intelligence Control and Systems Engineering Electrical and Electronic Engineering Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Generalized Algebraic Deadlock Avoidance Policies for Sequential Resource Allocation Systems

Correctness Verification of Generalized Algebraic Deadlock Avoidance Policies Through Mathematical Programming

Algebraic deadlock avoidance policies for conjunctive / disjunctive resource allocation systems (2001).

Algebraic synthesis of efficient deadlock avoidance policies for sequential resource allocation systems

Enhancing the flexibility of algebraic deadlock avoidance policies through Petri net structural analysis

A polynomial-complexity deadlock avoidance policy for sequential resource allocation systems with multiple resource acquisitions and flexible routings

Flexible routing and deadlock avoidance in automated manufacturing systems

Correctness Verification of Generalized Algebraic Deadlock Avoidance Policies through Mathematical Programming

Optimal Polynomial Complexity Deadlock Avoidance Policies for Manufacturing Systems with Flexible Routings

Algebraic deadlock avoidance policies for conjunctive/disjunctive resource allocation systems

Similar Documents

Generalized Algebraic Deadlock Avoidance Policies for Sequential Resource Allocation Systems

Correctness Verification of Generalized Algebraic Deadlock Avoidance Policies Through Mathematical Programming

Algebraic deadlock avoidance policies for conjunctive / disjunctive resource allocation systems (2001).

Algebraic synthesis of efficient deadlock avoidance policies for sequential resource allocation systems

Enhancing the flexibility of algebraic deadlock avoidance policies through Petri net structural analysis

A polynomial-complexity deadlock avoidance policy for sequential resource allocation systems with multiple resource acquisitions and flexible routings

Flexible routing and deadlock avoidance in automated manufacturing systems

Correctness Verification of Generalized Algebraic Deadlock Avoidance Policies through Mathematical Programming

Optimal Polynomial Complexity Deadlock Avoidance Policies for Manufacturing Systems with Flexible Routings

Algebraic deadlock avoidance policies for conjunctive/disjunctive resource allocation systems