查詢結果分析
相關文獻
- A New Algorithm for Distributed Mutual Exclusion
- 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
- A Fault-Tolerant Triple Triangular Mesh Protocol for Distributed Mutual Exclusion
- 澳洲分散式系統技術中心與都柏林核心集
- 無線區域網路IEEE 802.11標準簡介
- 臺灣股票店頭市場股價報酬波動行為的研究
- A Fast Convolution Algorithm for Biorthogonal Wavelet Image Compression
- A Demand-Driven Shop-Floor Control Model for Distributed Manufacturing Systems
- 模糊性拜占庭協議[Byzantine Agreement]初探
頁籤選單縮合
題 名 | A New Algorithm for Distributed Mutual Exclusion=一個新的分散式互斥演算法則 |
---|---|
作 者 | 連秀婂; 袁賢銘; | 書刊名 | 德明學報 |
卷 期 | 13 1998.05[民87.05] |
頁 次 | 頁113-124 |
分類號 | 310.153 |
關鍵詞 | 互斥; 分散式系統; 對稱性; Mutual exclusion; Distributed systems; Critical section; Symmetry; |
語 文 | 英文(English) |
中文摘要 | 本篇論本文對電腦網路提出一個分散式、對稱的互斥演算法則,所提出之演算法 則可用在任意大小的分散式系統,而且它與Maekawa的O( )演算法則[4]有相同的訊息 複雜度;當一個系統的對稱性為主要關鍵時,此演算法則將比Maekawa 的法則更適用。此 外,對於一個2 個節點的系統來說,它的請求集大小比Gupta,Bruell及Ghosh [1]等人所 提出的互斥演算法則還要小。 |
英文摘要 | This paper presents a decentralized, symmetric mutual exclusion algorithm in a computer network. The proposed algorithm can be applied to arbitrary sizes of distributed systems and has the same message complexity as Maekawa's O( ) algorithm [4]. It is more suitable than Maekawa's when the symmetry of a system is a criticism. Besides, it has smaller request set size than Gupta, Bruell and Ghosh's mutual exclusion algorithm [1] on a 2 -node system. |
本系統中英文摘要資訊取自各篇刊載內容。