查詢結果分析
相關文獻
- Nondominated (K, M)-Coteries for the K-out of-M Resources Allocation Problme
- Binomial(q, k)-Arbiters with Uniform Quorums for h-out of-k Mutual Exclusion
- 模糊性拜占庭協議[Byzantine Agreement]初探
- Reaching Byzantine Agreement under a Hybrid Fault Model
- A Fault-Tolerant Triple Triangular Mesh Protocol for Distributed Mutual Exclusion
- 混合錯誤模式在通訊線路之最佳的協議通訊協定
- Asynchronous Power-Saving Protocols via Quorum Systems for IEEE 802.11 Ad Hoc Networks
- An Efficient Communication-Induced Checkpointing Protocol
- The Discovery of Consensus Underlying a Dual Fallible Cloud Computing Environment
- Byzantine Agreement with Dual Failure Mode for Virtual Subnet of Mobile Ad-hoc Network
頁籤選單縮合
題名 | Binomial(q, k)-Arbiters with Uniform Quorums for h-out of-k Mutual Exclusion=h-out of-k互斥問題之均勻法團Binomial(q, k)-Arbiters |
---|---|
作者姓名(中文) | 郭育政; | 書刊名 | 東吳經濟商學學報 |
卷期 | 34 2001.09[民90.09] |
頁次 | 頁95-109 |
分類號 | 312.49 |
關鍵詞 | 分散式系統; 容錯; 法團; h-out of-k互斥; Distributed systems; Fault tolerance; h-out of-k mutual exclusion; Quorums; |
語文 | 英文(English) |
中文摘要 | k-Arbiters是一個很好的概念,常被用來解決分散式h-out of-k互斥問題。 分散式h-out of-k互斥問題若使用此k-arbiters概念來解,其解法將具備有低 通訊成本與高容錯力的優點。然而由於k-arbiters的定義,要求其所包含的任k+l組法團中,均要存在非空的交集,也因此建構k-arbiters是一件困難的事,尤其當k值很大時。本篇論文中,我們提出一個簡單的方法來建構ιarbiters'此建構出的k-arbiters稱binomial(q, k)-arbiters,其有均勻的特性:每一法團大小一致且每一節點包含在相同數量的法團之中。 |
英文摘要 | k-Arbiter is a useful concept for solving the distributed h-out of-k mutual exclusion problem. The distributed h-out of-k mutual exclssusion algorithms based on k-arbiter have the benefits of high fault-tolerance and low message cost. However, according to the definition of k-arbiter, it is required to have a non-empty intersection among any (k+ 1) quorums in a k-arbiter. Consequently, constructing k-arbiters is difficult. In this paper, we propose a simple scheme to construct k-arbiters for any integer k. The constructed k-arbiters, named binomial(q, k)-arbiters, are uniform: each quorum in a k-arbiter has the same size and each node contains in the same number of quorums. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。