A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Filters
Fast Nonblocking Persistence for Concurrent Data Structures
[article]
2021
arXiv
pre-print
Preserved Fulltext
Other Versions
We present a fully lock-free variant of the recent Montage system for persistent data structures. ...
Our variant, nbMontage, adds persistence to almost any nonblocking concurrent structure without introducing significant overhead or blocking of any kind. ...
[29] presented a mechanical transform that will turn any linearizable nonblocking concurrent data structure into an equivalent persistent structure. ...
arXiv:2105.09508v1
fatcat:b6e3gqpvgvg3telz65onscdmnm
Fast Nonblocking Persistence for Concurrent Data Structures
2021
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
We present a fully lock-free variant of our recent Montage system for persistent data structures. ...
The variant, nbMontage, adds persistence to almost any nonblocking concurrent structure without introducing significant overhead or blocking of any kind. ...
Read-only operations may linearize at a load.
14:8 Fast Nonblocking Persistence for Concurrent Data Structures 3. ...
doi:10.4230/lipics.disc.2021.14
fatcat:crag6hgd65dgzgt4bhzrizqhza
Montage: A General System for Buffered Durably Linearizable Data Structures
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
It also arranges to persist only that data minimally required to reconstruct the structure after a crash. ...
We present what we believe to be the first general-purpose approach to building buffered durably linearizable persistent data structures, and a system, Montage, to support that approach. ...
This criterion builds on the familiar notion of linearizability for concurrent (non-persistent) data structures. ...
arXiv:2009.13701v1
fatcat:6r3jpxoy2vd6nil4c4ed5yh5oe
Toward high performance nonblocking software transactional memory
2008
Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming - PPoPP '08
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
In particular, our design is based on the philosophy of keeping the common, contention free execution path as simple (consequently fast) as possible, while resorting to the more expensive data displacement ...
via store instructions, all leading to a more streamlined and efficient fast path. ...
Acknowdegments We are grateful to Yossi Lev for initial discussions, and to Dave Dice for providing us with a copy of TL2. ...
doi:10.1145/1345206.1345240
dblp:conf/ppopp/MaratheM08
fatcat:2rah6beyfrfmbgdhpohilnujdy
Understanding and Optimizing Persistent Memory Allocation
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
For full generality, such data requires dynamic memory allocation, and while the allocator could in principle "rolled into" each data structure, it is desirable to make it a separate abstraction. ...
Toward this end, we introduce recoverability, a correctness criterion for persistent allocators, together with a nonblocking allocator, Ralloc, that satisfies this criterion. ...
By using offset-based pointers, Ralloc supports position-independent data for flexible sharing across executions and among concurrent processes. ...
arXiv:2003.06718v1
fatcat:x4ig7vil2zd5tkmsqnxe7r6pye
Understanding and optimizing persistent memory allocation
2020
Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
For full generality, such data requires dynamic memory allocation, and while the allocator could in principle be "rolled into" each data structure, it is desirable to make it a separate abstraction. ...
Toward this end, we introduce recoverability, a correctness criterion for persistent allocators, together with a nonblocking allocator, Ralloc, that satisfies this criterion. ...
By using offset-based pointers, Ralloc supports position-independent data for flexible sharing across executions and among concurrent processes. ...
doi:10.1145/3332466.3374502
dblp:conf/ppopp/CaiWBHS20
fatcat:tor2ycf5i5fv3jhadfwmsmzpye
Interval-based memory reclamation
2018
Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming - PPoPP '18
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper we present interval-based reclamation (IBR), a new approach to safe reclamation of disconnected memory blocks in nonblocking concurrent data structures. ...
data structures. ...
Introduction Pointer-rich nonblocking concurrent data structures pose a difficult safety challenge for memory managers. ...
doi:10.1145/3178487.3178488
dblp:conf/ppopp/WenICBS18
fatcat:v3qcujeaj5f7daotjtkfwyazdu
Concurrent tries with efficient non-blocking snapshots
2012
Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming - PPoPP '12
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We show how to implement an efficient lock-free snapshot operation for concurrent hash tries. The snapshot operation uses a single-word compare-and-swap and avoids copying the data structure eagerly. ...
We compare concurrent hash trie performance with other concurrent data structures and evaluate the performance of the snapshot operation. ...
Doug Lea at the State University of New York at Oswego for his help. We would also like to thank Eva Darulova and Tihomir Gvero at the EPFL for the useful discussions we've lead. ...
doi:10.1145/2145816.2145836
dblp:conf/ppopp/ProkopecBBO12
fatcat:qgifwoagj5fgrndkdsb6e6ham4
Recipe
2019
Proceedings of the 27th ACM Symposium on Operating Systems Principles - SOSP '19
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2019 pre-print arXiv:1909.13670v3 fatcat:26iilht5jvaktjlxgapyiaxdduOther Versions
We present Recipe, a principled approach for converting concurrent DRAM indexes into crash-consistent indexes for persistent memory (PM). ...
For example, we built P-CLHT, our PM implementation of the CLHT hash table by modifying only 30 LOC. ...
Acknowledgments We would like to thank our shepherd, Peter Chen, the anonymous reviewers, and members of Systems and Storage Lab and LASR group for their feedback and guidance. We are also ...
doi:10.1145/3341301.3359635
dblp:conf/sosp/LeeMKKC19
fatcat:gxbpwvv7tnecfaorv7wyv7tx2i
Supporting Adaptable Consistency Control in Structured Collaborative Workspaces
2005
Computer Supported Cooperative Work (CSCW)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Data-protocol bindings can happen at the property, object, and workspace levels. ...
We propose a component-based framework that allows for the runtime plug-n-play of consistency protocols in collaborative systems. ...
Apparently, nonblocking attach of protocols can achieve fast local response but at the risk of cascading undo when the detach is also nonblocking. ...
doi:10.1007/s10606-005-9003-y
fatcat:dzmuiqnowzadnichsr7ursyk3q
Page 7880 of Mathematical Reviews Vol. , Issue 99k
[page]
1999
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Pandu Rangan, Probabilistic data structures for priority queues (extended abstract) (143-154); David Zuckerman, Extractors for weak random sources and their applications (155-157); Gerth Stoelting Brodal ...
Tarjan, Simple confluently persistent catenable lists (extended abstract) (119-130); Venkatesh Raman and Sarnath Ramnath, Improved upper bounds for time-space tradeoffs for selection with limited storage ...
Parallel Index-based Stream Join on a Multicore CPU
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, we introduce an index data structure, called the Partitioned In-memory Merge-Tree, to address the challenges that arise when indexing highly dynamic data, which are common in streaming settings ...
However, designing an effective concurrency control mechanism that addresses the problem of concurrent indexing in highly dynamic settings remains a challenge. ...
(Hp · λ i b ) (4)
CONCURRENT WINDOW INDEXING In this section, we present the design of our indexing data structures for join processing. ...
arXiv:1903.00452v1
fatcat:xqf7zbvkeffo5bg277anze3roa
SEDA
2001
Proceedings of the eighteenth ACM symposium on Operating systems principles - SOSP '01
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
We propose a new design for highly concurrent Internet services, which we call the staged event-driven architecture (SEDA). ...
SEDA is intended to support massive concurrency demands and simplify the construction of well-conditioned services. ...
We would like to thank Steve Gribble, Joe Hellerstein, and Marti Hearst for their valuable input on this paper. ...
doi:10.1145/502034.502057
dblp:conf/sosp/WelshCB01
fatcat:3ualauwitnbbpagike4o6qtoo4
SEDA
2001
ACM SIGOPS Operating Systems Review
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
We propose a new design for highly concurrent Internet services, which we call the staged event-driven architecture (SEDA). ...
SEDA is intended to support massive concurrency demands and simplify the construction of well-conditioned services. ...
We would like to thank Steve Gribble, Joe Hellerstein, and Marti Hearst for their valuable input on this paper. ...
doi:10.1145/502059.502057
fatcat:dz5oysidpncbljxilcyig7gzx4
Mobile Application Development with MELON
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Based on a distributed shared message store, MELON abstracts network communication to an asynchronous exchange of persistent messages. ...
Developing distributed applications for mobile ad hoc network continues to be challenging due to the dynamic and unpredictable nature of MANETs. ...
For atomic updates, the write / read array uses a readers/writer lock to allow multiple read operations to access the array concurrently, but locks the array for write operations. ...
doi:10.1007/978-3-319-07425-2_20
fatcat:xm2llxsgtfe5bdolphwhckq7oa
« Previous
Showing results 1 — 15 out of 415 results