Decomposition Approach of Banker's Algorithm : Design and Concurrency Analysis (Software Systems)

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 社団法人電子情報通信学会の論文
• 2004-01-01

著者

• OH Hoon

  Department of Food Science and Technology, Sejong University

• Oh H

  Department Of Computerand Communications Kangwon National University

• Oh Hoon

  Department Of Food Science And Technology Sejong University

• OH Hoon

  Department of Computer Engineering and Information Technology, University of Ulsan

関連論文

• Antimicrobial Characteristics of Chitosans against Food Spoilage Microorganisms in Liquid Media and Mayonnaise(Food & Nutrition Science)
• Proactive Cluster-Based Distance Vector (PCDV) Routing Protocol in Mobile Ad Hoc Networks(Network)
• Decomposition Approach of Banker's Algorithm : Design and Concurrency Analysis (Software Systems)
• Development of Embrocation for Denture Stomatitis : Miconazol Applied with Collagen Powder

スポンサーリンク