WEKO3
アイテム
Efficient Lock Algorithm for Shared Objects in SMP Environments
https://ipsj.ixsq.nii.ac.jp/records/10134
https://ipsj.ixsq.nii.ac.jp/records/101346117dfc5-b934-4030-93d6-e5f3dca8449d
名前 / ファイル | ライセンス | アクション |
---|---|---|
![]() |
Copyright (c) 2006 by the Information Processing Society of Japan
|
|
オープンアクセス |
Item type | Journal(1) | |||||||
---|---|---|---|---|---|---|---|---|
公開日 | 2006-12-15 | |||||||
タイトル | ||||||||
タイトル | Efficient Lock Algorithm for Shared Objects in SMP Environments | |||||||
タイトル | ||||||||
言語 | en | |||||||
タイトル | Efficient Lock Algorithm for Shared Objects in SMP Environments | |||||||
言語 | ||||||||
言語 | eng | |||||||
キーワード | ||||||||
主題Scheme | Other | |||||||
主題 | 論文 | |||||||
資源タイプ | ||||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
資源タイプ | journal article | |||||||
その他タイトル | ||||||||
その他のタイトル | プログラミング言語の実装技術 | |||||||
著者所属 | ||||||||
IBM Tokyo Research Laboratory Applied Computer Science Course Interfaculty Initiative in Information Studies Graduate School of Interdisciplinary Information Studies The University of Tokyo | ||||||||
著者所属 | ||||||||
IBM Tokyo Research Laboratory | ||||||||
著者所属 | ||||||||
IBM Tokyo Research Laboratory | ||||||||
著者所属(英) | ||||||||
en | ||||||||
IBM Tokyo Research Laboratory,Applied Computer Science Course, Interfaculty Initiative in Information Studies, Graduate School of Interdisciplinary Information Studies, The University of Tokyo | ||||||||
著者所属(英) | ||||||||
en | ||||||||
IBM Tokyo Research Laboratory | ||||||||
著者所属(英) | ||||||||
en | ||||||||
IBM Tokyo Research Laboratory | ||||||||
著者名 |
Takeshi, Ogasawara
× Takeshi, Ogasawara
|
|||||||
著者名(英) |
Takeshi, Ogasawara
× Takeshi, Ogasawara
|
|||||||
論文抄録 | ||||||||
内容記述タイプ | Other | |||||||
内容記述 | We propose a new algorithm that is effective for objects that are shared among threads but are not contended for in SMP environments. We can remove the overhead of the serialization between lock and other non-lock operations and avoid the latency of complex atomic operations in most cases. We established the safety of the algorithm by using a software tool called Spin. The experimental results from our benchmarking on an SMP machine using Intel Xeon processors revealed that our algorithm could significantly improve efficiency by 80% on average compared to using complex atomic instruction. | |||||||
論文抄録(英) | ||||||||
内容記述タイプ | Other | |||||||
内容記述 | We propose a new algorithm that is effective for objects that are shared among threads but are not contended for in SMP environments. We can remove the overhead of the serialization between lock and other non-lock operations and avoid the latency of complex atomic operations in most cases. We established the safety of the algorithm by using a software tool called Spin. The experimental results from our benchmarking on an SMP machine using Intel Xeon processors revealed that our algorithm could significantly improve efficiency by 80% on average compared to using complex atomic instruction. | |||||||
書誌レコードID | ||||||||
収録物識別子タイプ | NCID | |||||||
収録物識別子 | AN00116647 | |||||||
書誌情報 |
情報処理学会論文誌 巻 47, 号 12, p. 3287-3295, 発行日 2006-12-15 |
|||||||
ISSN | ||||||||
収録物識別子タイプ | ISSN | |||||||
収録物識別子 | 1882-7764 |