Decomposition Approach of Banker's Algorithm: Design and Concurrency Analysis

Hoon OH

Decomposition Approach of Banker's Algorithm: Design and Concurrency Analysis

Hoon OH

Full Text Views

0

Share
Cite this

Summary :

Concurrency in the computing systems using a deadlock avoidance strategy varies largely according to the way that resource usage plan of process is used in testing the possibility of deadlocks. If a detailed resource usage plan of process is to be taken into account, the deadlock avoidance problem is known to be NP-complete. A decomposition model to manage resources is proposed, where process is logically partitioned into a number of segments each of which uses at least one resource. It is shown that one of our deadlock avoidance algorithms achieves the best concurrency among the polynomial-bounded algorithms. We also present a heuristic algorithm that achieves concurrency close to the optimal one. Finally, we analyze concurrency of various algorithms.

Publication: IEICE TRANSACTIONS on Information Vol.E87-D No.1 pp.183-195

Publication Date: 2004/01/01

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Software Systems

Cite this

Copy

Hoon OH, "Decomposition Approach of Banker's Algorithm: Design and Concurrency Analysis" in IEICE TRANSACTIONS on Information, vol. E87-D, no. 1, pp. 183-195, January 2004, doi: .
Abstract: Concurrency in the computing systems using a deadlock avoidance strategy varies largely according to the way that resource usage plan of process is used in testing the possibility of deadlocks. If a detailed resource usage plan of process is to be taken into account, the deadlock avoidance problem is known to be NP-complete. A decomposition model to manage resources is proposed, where process is logically partitioned into a number of segments each of which uses at least one resource. It is shown that one of our deadlock avoidance algorithms achieves the best concurrency among the polynomial-bounded algorithms. We also present a heuristic algorithm that achieves concurrency close to the optimal one. Finally, we analyze concurrency of various algorithms.
URL: https://globals.ieice.org/en_transactions/information/10.1587/e87-d_1_183/_p

Copy

@ARTICLE{e87-d_1_183,
author={Hoon OH, },
journal={IEICE TRANSACTIONS on Information},
title={Decomposition Approach of Banker's Algorithm: Design and Concurrency Analysis},
year={2004},
volume={E87-D},
number={1},
pages={183-195},
abstract={Concurrency in the computing systems using a deadlock avoidance strategy varies largely according to the way that resource usage plan of process is used in testing the possibility of deadlocks. If a detailed resource usage plan of process is to be taken into account, the deadlock avoidance problem is known to be NP-complete. A decomposition model to manage resources is proposed, where process is logically partitioned into a number of segments each of which uses at least one resource. It is shown that one of our deadlock avoidance algorithms achieves the best concurrency among the polynomial-bounded algorithms. We also present a heuristic algorithm that achieves concurrency close to the optimal one. Finally, we analyze concurrency of various algorithms.},
keywords={},
doi={},
ISSN={},
month={January},}

Copy

TY - JOUR
TI - Decomposition Approach of Banker's Algorithm: Design and Concurrency Analysis
T2 - IEICE TRANSACTIONS on Information
SP - 183
EP - 195
AU - Hoon OH
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E87-D
IS - 1
JA - IEICE TRANSACTIONS on Information
Y1 - January 2004
AB - Concurrency in the computing systems using a deadlock avoidance strategy varies largely according to the way that resource usage plan of process is used in testing the possibility of deadlocks. If a detailed resource usage plan of process is to be taken into account, the deadlock avoidance problem is known to be NP-complete. A decomposition model to manage resources is proposed, where process is logically partitioned into a number of segments each of which uses at least one resource. It is shown that one of our deadlock avoidance algorithms achieves the best concurrency among the polynomial-bounded algorithms. We also present a heuristic algorithm that achieves concurrency close to the optimal one. Finally, we analyze concurrency of various algorithms.
ER -