{"created":"2025-01-19T00:44:22.807057+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00174149","sets":["1164:2240:8543:8882"]},"path":["8882"],"owner":"11","recid":"174149","title":["Performance assessment of highly concurrent sorted linked list with good spatial locality (Unrefereed Workshop Manuscript)"],"pubdate":{"attribute_name":"公開日","attribute_value":"2016-08-01"},"_buckets":{"deposit":"4067e08a-d250-4e0e-b253-a0eb8f8054d8"},"_deposit":{"id":"174149","pid":{"type":"depid","value":"174149","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"Performance assessment of highly concurrent sorted linked list with good spatial locality (Unrefereed Workshop Manuscript)","author_link":["356329","356331","356332","356330"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Performance assessment of highly concurrent sorted linked list with good spatial locality (Unrefereed Workshop Manuscript)"},{"subitem_title":"Performance assessment of highly concurrent sorted linked list with good spatial locality (Unrefereed Workshop Manuscript)","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"通信","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2016-08-01","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Center for Computational Sciences, University of Tsukuba"},{"subitem_text_value":"Faculty of Engineering, Information and Systems, University of Tsukuba"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Center for Computational Sciences, University of Tsukuba","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Engineering, Information and Systems, University of Tsukuba","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"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/174149/files/IPSJ-HPC16155035.pdf","label":"IPSJ-HPC16155035.pdf"},"date":[{"dateType":"Available","dateValue":"2018-08-01"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-HPC16155035.pdf","filesize":[{"value":"1.6 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":"14"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"15c467a3-4f09-4705-a14c-469517491cfc","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2016 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Mohamed, Amin Jabri"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Osamu, Tatebe"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Mohamed, Amin Jabri","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Osamu, Tatebe","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10463942","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-8841","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"In this paper, we present a highly concurrent sorted linked list using a lock-free approach. To achieve a good spatial locality in our design, the list is arranged into linked chunks of memory with pre-allocated fixed number of entry slots. Entries within a chunk are kept logically sorted and an inter-chunk procedure keeps them from becoming too sparse or too dense. The performance of our design under stress workloads is also presented.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this paper, we present a highly concurrent sorted linked list using a lock-free approach. To achieve a good spatial locality in our design, the list is arranged into linked chunks of memory with pre-allocated fixed number of entry slots. Entries within a chunk are kept logically sorted and an inter-chunk procedure keeps them from becoming too sparse or too dense. The performance of our design under stress workloads is also presented.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"4","bibliographic_titles":[{"bibliographic_title":"研究報告ハイパフォーマンスコンピューティング（HPC）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2016-08-01","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"35","bibliographicVolumeNumber":"2016-HPC-155"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":174149,"updated":"2025-01-20T07:01:36.717640+00:00","links":{}}