ログイン 新規登録
言語:

WEKO3

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

Field does not validate



インデックスリンク

インデックスツリー

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

WEKO

One fine body…

WEKO

One fine body…

アイテム

  1. 論文誌(トランザクション)
  2. データベース(TOD)[電子情報通信学会データ工学研究専門委員会共同編集]
  3. Vol.17
  4. No.4

Practical Persistent Multi-word Compare-and-Swap Algorithms for Many-core CPUs (Preprint)

https://ipsj.ixsq.nii.ac.jp/records/240414
https://ipsj.ixsq.nii.ac.jp/records/240414
9f52b3fc-c502-47ba-8de5-9103a5ff84dd
名前 / ファイル ライセンス アクション
IPSJ-TOD1704008.pdf IPSJ-TOD1704008.pdf (1.2 MB)
 2026年10月22日からダウンロード可能です。
Copyright (c) 2024 by the Information Processing Society of Japan
非会員:¥0, IPSJ:学会員:¥0, DBS:会員:¥0, IFAT:会員:¥0, DLIB:会員:¥0
Item type Trans(1)
公開日 2024-10-22
タイトル
タイトル Practical Persistent Multi-word Compare-and-Swap Algorithms for Many-core CPUs (Preprint)
タイトル
言語 en
タイトル Practical Persistent Multi-word Compare-and-Swap Algorithms for Many-core CPUs (Preprint)
言語
言語 eng
キーワード
主題Scheme Other
主題 [研究論文] persistent memory, multi-word compare-and-swap operations, multithreaded software
資源タイプ
資源タイプ識別子 http://purl.org/coar/resource_type/c_6501
資源タイプ journal article
著者所属
Graduate School of Informatics, Nagoya University
著者所属
Graduate School of Informatics, Nagoya University
著者所属
Graduate School of Informatics, Nagoya University
著者所属(英)
en
Graduate School of Informatics, Nagoya University
著者所属(英)
en
Graduate School of Informatics, Nagoya University
著者所属(英)
en
Graduate School of Informatics, Nagoya University
著者名 Kento, Sugiura

× Kento, Sugiura

Kento, Sugiura

Search repository
Manabu, Nishimura

× Manabu, Nishimura

Manabu, Nishimura

Search repository
Yoshiharu, Ishikawa

× Yoshiharu, Ishikawa

Yoshiharu, Ishikawa

Search repository
著者名(英) Kento, Sugiura

× Kento, Sugiura

en Kento, Sugiura

Search repository
Manabu, Nishimura

× Manabu, Nishimura

en Manabu, Nishimura

Search repository
Yoshiharu, Ishikawa

× Yoshiharu, Ishikawa

en Yoshiharu, Ishikawa

Search repository
論文抄録
内容記述タイプ Other
内容記述 In the last decade, academic and industrial researchers have focused on persistent memory because of the development of the first practical product, Intel Optane. One of the main challenges of persistent memory programming is to guarantee consistent durability over separate memory addresses, and Wang et al. proposed a persistent multi-word compare-and-swap (PMwCAS) algorithm to solve this problem. However, their algorithm contains redundant compare-and-swap (CAS) and cache flush instructions and does not achieve sufficient performance on many-core CPUs. This paper proposes a new algorithm to improve performance on many-core CPUs by removing useless CAS/flush instructions from PMwCAS operations. We also exclude dirty flags, which help ensure consistent durability in the original algorithm, from our algorithm using PMwCAS descriptors as write-ahead logs. Experimental results show that the proposed method is up to ten times faster than the original algorithm and suggests several productive uses of PMwCAS operations.
------------------------------
This is a preprint of an article intended for publication Journal of
Information Processing(JIP). This preprint should not be cited. This
article should be cited as: Journal of Information Processing Vol.32(2024) (online)
------------------------------
論文抄録(英)
内容記述タイプ Other
内容記述 In the last decade, academic and industrial researchers have focused on persistent memory because of the development of the first practical product, Intel Optane. One of the main challenges of persistent memory programming is to guarantee consistent durability over separate memory addresses, and Wang et al. proposed a persistent multi-word compare-and-swap (PMwCAS) algorithm to solve this problem. However, their algorithm contains redundant compare-and-swap (CAS) and cache flush instructions and does not achieve sufficient performance on many-core CPUs. This paper proposes a new algorithm to improve performance on many-core CPUs by removing useless CAS/flush instructions from PMwCAS operations. We also exclude dirty flags, which help ensure consistent durability in the original algorithm, from our algorithm using PMwCAS descriptors as write-ahead logs. Experimental results show that the proposed method is up to ten times faster than the original algorithm and suggests several productive uses of PMwCAS operations.
------------------------------
This is a preprint of an article intended for publication Journal of
Information Processing(JIP). This preprint should not be cited. This
article should be cited as: Journal of Information Processing Vol.32(2024) (online)
------------------------------
書誌レコードID
収録物識別子タイプ NCID
収録物識別子 AA11464847
書誌情報 情報処理学会論文誌データベース(TOD)

巻 17, 号 4, 発行日 2024-10-22
ISSN
収録物識別子タイプ ISSN
収録物識別子 1882-7799
出版者
言語 ja
出版者 情報処理学会
戻る
0
views
See details
Views

Versions

Ver.1 2025-01-19 07:59:15.547074
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

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

Confirm


Powered by WEKO3


Powered by WEKO3