Efficient Lock-Free Durable Sets

Efficient Lock-Free Durable Sets

Non-volatile memory is expected to co-exist or replace DRAM in upcoming architectures. Durable concurrent data structures for non-volatile memories are essential building blocks for constructing adequate software for use with these architectures. In this paper, we propose a new approach for durable...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2019-09
Hauptverfasser: Zuriel, Yoav, Friedman, Michal, Sheffi, Gali, Cohen, Nachshon, Petrank, Erez
Format: Artikel
Sprache:eng
Schlagworte:
Data structures
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Zuriel, Yoav
Friedman, Michal
Sheffi, Gali
Cohen, Nachshon
Petrank, Erez
description Non-volatile memory is expected to co-exist or replace DRAM in upcoming architectures. Durable concurrent data structures for non-volatile memories are essential building blocks for constructing adequate software for use with these architectures. In this paper, we propose a new approach for durable concurrent sets and use this approach to build the most efficient durable hash tables available today. Evaluation shows a performance improvement factor of up to 3.3x over existing technology.
format Article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2287848392</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2287848392</sourcerecordid><originalsourceid>FETCH-proquest_journals_22878483923</originalsourceid><addsrcrecordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mRQcE1Ly0zOTM0rUfDJT87WdStKTVVwKS1KTMpJVQhOLSnmYWBNS8wpTuWF0twMym6uIc4eugVF-YWlqcUl8Vn5pUV5QKl4IyMLcwsTC2NLI2PiVAEAtx8skg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2287848392</pqid></control><display><type>article</type><title>Efficient Lock-Free Durable Sets</title><source>Free E- Journals</source><creator>Zuriel, Yoav ; Friedman, Michal ; Sheffi, Gali ; Cohen, Nachshon ; Petrank, Erez</creator><creatorcontrib>Zuriel, Yoav ; Friedman, Michal ; Sheffi, Gali ; Cohen, Nachshon ; Petrank, Erez</creatorcontrib><description>Non-volatile memory is expected to co-exist or replace DRAM in upcoming architectures. Durable concurrent data structures for non-volatile memories are essential building blocks for constructing adequate software for use with these architectures. In this paper, we propose a new approach for durable concurrent sets and use this approach to build the most efficient durable hash tables available today. Evaluation shows a performance improvement factor of up to 3.3x over existing technology.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Data structures</subject><ispartof>arXiv.org, 2019-09</ispartof><rights>2019. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>780,784</link.rule.ids></links><search><creatorcontrib>Zuriel, Yoav</creatorcontrib><creatorcontrib>Friedman, Michal</creatorcontrib><creatorcontrib>Sheffi, Gali</creatorcontrib><creatorcontrib>Cohen, Nachshon</creatorcontrib><creatorcontrib>Petrank, Erez</creatorcontrib><title>Efficient Lock-Free Durable Sets</title><title>arXiv.org</title><description>Non-volatile memory is expected to co-exist or replace DRAM in upcoming architectures. Durable concurrent data structures for non-volatile memories are essential building blocks for constructing adequate software for use with these architectures. In this paper, we propose a new approach for durable concurrent sets and use this approach to build the most efficient durable hash tables available today. Evaluation shows a performance improvement factor of up to 3.3x over existing technology.</description><subject>Data structures</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mRQcE1Ly0zOTM0rUfDJT87WdStKTVVwKS1KTMpJVQhOLSnmYWBNS8wpTuWF0twMym6uIc4eugVF-YWlqcUl8Vn5pUV5QKl4IyMLcwsTC2NLI2PiVAEAtx8skg</recordid><startdate>20190909</startdate><enddate>20190909</enddate><creator>Zuriel, Yoav</creator><creator>Friedman, Michal</creator><creator>Sheffi, Gali</creator><creator>Cohen, Nachshon</creator><creator>Petrank, Erez</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20190909</creationdate><title>Efficient Lock-Free Durable Sets</title><author>Zuriel, Yoav ; Friedman, Michal ; Sheffi, Gali ; Cohen, Nachshon ; Petrank, Erez</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_22878483923</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Data structures</topic><toplevel>online_resources</toplevel><creatorcontrib>Zuriel, Yoav</creatorcontrib><creatorcontrib>Friedman, Michal</creatorcontrib><creatorcontrib>Sheffi, Gali</creatorcontrib><creatorcontrib>Cohen, Nachshon</creatorcontrib><creatorcontrib>Petrank, Erez</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Access via ProQuest (Open Access)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zuriel, Yoav</au><au>Friedman, Michal</au><au>Sheffi, Gali</au><au>Cohen, Nachshon</au><au>Petrank, Erez</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Efficient Lock-Free Durable Sets</atitle><jtitle>arXiv.org</jtitle><date>2019-09-09</date><risdate>2019</risdate><eissn>2331-8422</eissn><abstract>Non-volatile memory is expected to co-exist or replace DRAM in upcoming architectures. Durable concurrent data structures for non-volatile memories are essential building blocks for constructing adequate software for use with these architectures. In this paper, we propose a new approach for durable concurrent sets and use this approach to build the most efficient durable hash tables available today. Evaluation shows a performance improvement factor of up to 3.3x over existing technology.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2019-09
issn 2331-8422
language eng
recordid cdi_proquest_journals_2287848392
source Free E- Journals
subjects Data structures
title Efficient Lock-Free Durable Sets
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T03%3A54%3A12IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Efficient%20Lock-Free%20Durable%20Sets&rft.jtitle=arXiv.org&rft.au=Zuriel,%20Yoav&rft.date=2019-09-09&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2287848392%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2287848392&rft_id=info:pmid/&rfr_iscdi=true