ログイン
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

  1. 研究論文

Timed Uniform Atomic Broadcast in Presence of Crash and Timing Faults

https://nitech.repo.nii.ac.jp/records/5224
https://nitech.repo.nii.ac.jp/records/5224
7deda085-724d-4746-b0bc-751e0d0d937c
名前 / ファイル ライセンス アクション
E88-D_72.pdf 本文_fulltext (254.1 kB)
Copyright (c) 2005 IEICE http://search.ieice.org/index.html
Item type 学術雑誌論文 / Journal Article(1)
公開日 2013-06-25
タイトル
タイトル Timed Uniform Atomic Broadcast in Presence of Crash and Timing Faults
言語 en
言語
言語 eng
資源タイプ
資源タイプ識別子 http://purl.org/coar/resource_type/c_6501
資源タイプ journal article
著者 泉, 泰介

× 泉, 泰介

en Izumi, Taisuke

ja 泉, 泰介
ISNI

ja-Kana イズミ, タイスケ


Search repository
Masuzawa, Toshimitsu

× Masuzawa, Toshimitsu

en Masuzawa, Toshimitsu

Search repository
著者別名
姓名 Izumi, Taisuke
言語 en
姓名 泉, 泰介
言語 ja
姓名 イズミ, タイスケ
言語 ja-Kana
書誌情報 en : IEICE transactions on information and systems

巻 E88-D, 号 1, p. 72-81, 発行日 2005-01-01
出版者
出版者 Institute of Electronics, Information and Communication Engineers
言語 en
ISSN
収録物識別子タイプ ISSN
収録物識別子 0916-8532
item_10001_source_id_32
収録物識別子タイプ NCID
収録物識別子 AA10826272
出版タイプ
出版タイプ VoR
出版タイプResource http://purl.org/coar/version/c_970fb48d4fbd8a85
内容記述
内容記述タイプ Other
内容記述 Δ-Timed Atomic Broadcast is the broadcast ensuring that all correct processes deliver the same messages in the same order, and that delivery latency of any message broadcast by any correct process is some predetermined time Δ or less. In this paper, we propose a Δ-timed atomic broadcast algorithm in a synchronous system where communication delay is bounded by a known constant d and processes suffer both crash faults and timing faults. The proposed algorithm can tolerate fc crash faults and ft timing faults as long as at least ft + 1 processes are correct, and its maximum delivery latency Δ is (2f' + 7)d where f' is the actual number of (crash or timing) faulty processes. That is, the algorithm attains the early-delivery in the sense that its delivery latency depends on the actual number of faults rather than the maximum number of faults that the algorithm can tolerate. Moreover, the algorithm has a distinct advantage of guaranteeing that timing-faulty processes also deliver the same messages in the same order as the correct processes (Uniformity). We also investigate the maximum number of faulty processes that can be tolerated. We show that no Δ-timed atomic broadcast algorithm can tolerate ft timing faults, if at most ft processes are correct. The impossibility result implies that the proposed algorithm achieves the maximum fault-resilience with respect to the number of faulty processes.
言語 en
戻る
0
views
See details
Views

Versions

Ver.1 2023-05-15 13:39:34.599721
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR 2.0
  • OAI-PMH JPCOAR 1.0
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3