{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00237560","sets":["1164:1867:11465:11705"]},"path":["11705"],"owner":"44499","recid":"237560","title":["状態機械複製プロトコルRabiaの評価"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-08-01"},"_buckets":{"deposit":"b113b630-1c06-43f8-8ea7-5688be503ca6"},"_deposit":{"id":"237560","pid":{"type":"depid","value":"237560","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"状態機械複製プロトコルRabiaの評価","author_link":["650482","650481"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"状態機械複製プロトコルRabiaの評価"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"分散処理・並行処理","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2024-08-01","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"慶應義塾大学環境情報学部"},{"subitem_text_value":"慶應義塾大学環境情報学部"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/237560/files/IPSJ-OS24164015.pdf","label":"IPSJ-OS24164015.pdf"},"date":[{"dateType":"Available","dateValue":"2026-08-01"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-OS24164015.pdf","filesize":[{"value":"1.9 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"11"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"41f14cdd-1c75-4c42-ad4e-f7e9e236cb30","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"高田, 晴成"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"川島, 英之"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10444176","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8795","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"故障に耐えうる堅牢なデータシステムを実現するために，データを複数のコンピュータに複製する手法として状態機械複製 (SMR) が存在する．SMR との代表例として Paxos や Raft が挙げられる．Paxos はその難解さにより実用が困難であると報告されており，それを踏まえて開発された理解のしやすさを重視した Raft においても，マシン故障の際のリーダー選出などの補助的なプロトコルの実装が容易ではなく，実システムへの統合において課題が残っている．Rabia は，乱択合意アルゴリズムを採用し，Paxos や Raft などの既存のプロトコルと比較して格段に単純な設計を達成した．従来の研究では乱択合意アルゴリズムは決定論的合意アルゴリズムに比べ性能が大幅に劣ることから実用性がないと考えられてきた．しかし Rabia は単一のデータセンター環境においてノード数が 3 の時，Multi-Paxos，EPaxos と比較して高いスループットを達成する．その他一部の条件においても他の SMR と比べて競争力のある性能を提供する．本研究では Rabia を様々な条件下で評価することで，Rabia の性能について詳細に分析する．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"研究報告システムソフトウェアとオペレーティング・システム（OS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2024-08-01","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"15","bibliographicVolumeNumber":"2024-OS-164"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":237560,"updated":"2025-01-19T08:50:41.960068+00:00","links":{},"created":"2025-01-19T01:40:15.337665+00:00"}