Bounded-Bypass Mutual Exclusion with Minimum Number of Registers
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
1737 | en_US |
dc.citation.issue |
12 | en_US |
dc.citation.spage |
1726 | en_US |
dc.citation.volume |
20 | en_US |
dc.citation.woscount |
0 | |
dc.contributor.author |
Chen, Sheng-Hsiung | en_US |
dc.contributor.author |
Huang, Ting-Lu | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:08:13Z | |
dc.date.available |
2014-12-08T15:08:13Z | |
dc.date.issued |
2009-12-01 | en_US |
dc.description.abstract |
A mutual exclusion mechanism that is both fair and space efficient can be highly valuable for shared memory systems under time and memory constraints such as embedded real-time systems. Several algorithms that utilize only one shared variable and guarantee a certain level of fairness have been proposed. However, these use hypothetical read-modify-write operations that have never been implemented in any system. This paper presents two fair algorithms that do not use such operations, each of which uses a single additional shared variable. The proposed algorithms employ commonly available operations, fetch&store and read/write, on two shared variables. The first algorithm satisfies the bounded-bypass condition. The second is an improvement on the first that satisfies the FIFO condition, which is the most stringent fairness condition. Additionally, it is shown that achieving the bounded-bypass condition using the same set of operations requires two shared variables. Both of the algorithms are thus optimal with respect to the number of shared variables. | en_US |
dc.identifier.doi |
10.1109/TPDS.2009.28 | en_US |
dc.identifier.issn |
1045-9219 | en_US |
dc.identifier.journal |
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1109/TPDS.2009.28 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/6397 | |
dc.identifier.wosnumber |
WOS:000271464900003 | |
dc.language.iso |
en_US | en_US |
dc.subject |
Mutual exclusion | en_US |
dc.subject |
shared memory systems | en_US |
dc.subject |
space complexity | en_US |
dc.subject |
fetch&store | en_US |
dc.subject |
swap | en_US |
dc.subject |
bounded bypassing | en_US |
dc.subject |
FIFO | en_US |
dc.title |
Bounded-Bypass Mutual Exclusion with Minimum Number of Registers | en_US |
dc.type |
Article | en_US |
檔案
- 000271464900003.pdf (1.56 MB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
Chen, S.-H., & Huang, T.-L. (2009). Bounded-Bypass Mutual Exclusion with Minimum Number of Registers. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 20(12), 1726–1737. https://doi.org/10.1109/TPDS.2009.28
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/6397