New Constructions for Nondominated k-Coteries
スポンサーリンク
概要
- 論文の詳細を見る
The k-mutual exclusion problem is the problem of guaranteeing that no more than k computing nodes enter a critical section simultaneously. The use of a k-coterie, which is a special set of node groups, is known as a robust approach to this problem. In general, k-coteries are classified as either dominated or nondominated, and a mutual exclusion mechanism has maximal availability when it employs a nondominated k-coterie. In this paper, we propose two new schemes called VOT and DVOT for constructing nondominated k-coteries. We conduct a comparative evaluation of the proposed schemes and well-known previous schemes. The results clearly show the superiority of the proposed schemes.
- 社団法人電子情報通信学会の論文
- 2000-07-25
著者
-
KIKUNO Tohru
Graduate School of Information Science and Technology, Osaka University
-
Choi Eun
The Department Of Informatics And Mathematical Science Graduate School Of Engineering Science Osaka
-
Kikuno Tohru
Osaka Univ. Osaka
-
Kikuno Tohru
The Department Of Informatics And Mathematical Science Graduate School Of Engineering Science Osaka
-
Kikuno Tohru
The Authors Are With The Department Of Informatics And Mathematical Science Graduate School Of Engin
-
Tsuchiya Tatsuhiro
Graduate School Of Information Science And Technology Osaka University
-
Tsuchiya Tatsuhiro
The Department Of Informatics And Mathematical Science Graduate School Of Engineering Science Osaka
-
Tsuchiya Tatsuhiro
The Department Of Informatics And Mathematical Science Osaka University
-
Kikuno T
Graduate School Of Information Science And Technology Osaka University
-
Choi E
Toshiba Corp.
-
Tsuchiya Tatsuhiro
Department Of Informatics And Mathematical Science Graduate School Of Engineering Science Osaka Univ
関連論文
- Probabilistic Model Checking of the One-Dimensional Ising Model
- Constructing Overlay Networks with Short Paths and Low Communication Cost
- On the Time Complexity of Dijkstra's Three-State Mutual Exclusion Algorithm
- Feature Interaction Verification Using Unbounded Model Checking with Interpolation
- Prediction of Fault-Prone Software Modules Using a Generic Text Discriminator
- Probabilistic Model Checking of the One-Dimensional Ising Model
- An Effective Testing Method for Hardware Related Fault in Embedded Software(Software Engineering for Embedded Systems)
- Feature Interaction Detection by Bounded Model Checking(Dependable Communication)(Dependable Computing)
- Software Project Simulator for Effective Process Improvement (特集 〔情報処理学会〕創立40周年記念論文)
- Three-Mode Failure Model for Reliability Analysis of Distributed Programs (Special Issue on Fault-Tolerant Computing)
- Verifying Fault Tolerance of Concurrent Systems by Model Checking(Special Section on Concurrent System Technology and Its Application to Multiple Agent Systems)
- A Hierarchical Approach to Dependability Evaluation of Distributed Systems with Replicated Resources
- Computing the Stabilization Times of SElf-Stabilizing Systems (Special Section on Concurrent Systems Technology)
- New Constructions for Nondominated k-Coteries
- New System Model Based on Autonomous Decentralized System for Highly Productive Processing Equipment (IEICE/IEEE Joint Special Issue on Autonomous Decentralized Systems)
- Constructing a Bayesian Belief Network to Predict Final Quality in Embedded System Development(Software Engineering for Embedded Systems)
- Test Item Prioritizing Metrics for Selective Software Testing(Software Engineering)
- Enhancing Software Project Simulator toward Risk Prediction with Cost Estimation Capability(Special Section on Concurrent Systems Technology)
- Experimental Evaluation of Two-Phase Project Control for Software Development Process(Special Section on Concurrent Systems Technology)
- A New Verification Method Using Virtual System States for Responsive Communication Protocols and Its Application to a Broadcasting Protocol(Special Section on Concurrent Systems Technology)
- Timed Reachability Analysis Method for Communication Protocols Modeled by Extended Finite State Machines (Special Issue on Multimedia Communication and Distributed Processing)
- Experimental Evaluation of Processor Scheduling Algorithm for Parallel Logic Simulation Using Benchmark Circuits
- New 2-Factor Covering Designs for Software Testing(Regular Section)
- Model Checking Active Database Rules under Various Rule Processing Strategies
- A BDD-based approach to reliability-optimal module allocation in networks (信頼性)
- SAT and SMT based model checking of concurrent systems (コンカレント工学)
- Parallelizing SDP(Sum of Disjoint Products)Algorithms for Fast Reliability Analysis
- An Energy-Efficient Broadcast Scheme for Multihop Wireless Ad Hoc Networks Using Variable-Range Transmission Power(Networks)
- Effective Scheduling of Duplicated Tasks for Fault Tolerance in Multiprocessor Systems
- Error Models and Fault-Secure Scheduling in Multiprocessor Systems
- The Time Complexity of Hsu and Huang's Self-Stabilizing Maximal Matching Algorithm
- Constructing Overlay Networks with Short Paths and Low Communication Cost
- Analysis of Rollbacks in Parallel Logic Simulation Based on Virtual Time*
- Modulation of Cytochrome P4501-mediated Bioactivation of Benzo[a]pyrene by Volatile Allyl Sulfides in Human Hepatoma Cells(Food & Nutrition Science)
- Using Satisfiability Solving for Pairwise Testing in the Presence of Constraints
- Model Checking Active Database Rules under Various Rule Processing Strategies
- Using Satisfiability Solving for Pairwise Testing in the Presence of Constraints