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.
Filters
An Adaptive Technique for Constructing Robust and High-Throughput Shared Objects
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
Moreover, whereas BWC is only lock-free, our algorithm is more robust, since it is wait-free. ...
It is desired that they, like shared objects in general, be robust, linearizable and scalable. ...
Hendler, Shavit, and Yerushalmi [14] presented an elimination-based randomized linearizable stack algorithm that is both lock-free and scalable in practice. Moir et al. ...
doi:10.1007/978-3-642-17653-1_24
fatcat:4gqrflvvgfezhipqf3w3koytzy
Scalable shared memory LTL model checking
2010
International Journal on Software Tools for Technology Transfer (STTT)
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 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present a design for a parallel shared memory LTL model checker that is based on a distributed memory algorithm. ...
To improve the scalability of our tool, we have devised a number of implementation techniques which we present in this paper. ...
Each thread has its own private pool and therefore the implementation is lock-free. ...
doi:10.1007/s10009-010-0136-z
fatcat:fubzyevrg5gyxod3webxflmrga
Cruiser
2012
SIGPLAN notices
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 2017; you can also visit the original URL.
The file type is application/pdf.
We present a concurrent heap buffer overflow detector, CRUISER, in which a concurrent thread is added to the user program to monitor heap integrity, and custom lock-free data structures and algorithms ...
are designed to achieve high efficiency and scalability. ...
Michael for pointing to us the open source project "Amino Concurrent Building Blocks" [46] , Andrew Appel and Xi Xiong for their valuable comments, and the anonymous reviewers for their comments that ...
doi:10.1145/2345156.1993541
fatcat:z2yp63w4dbbunems6ttc6mgike
Cruiser
2011
SIGPLAN notices
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 2017; you can also visit the original URL.
The file type is application/pdf.
We present a concurrent heap buffer overflow detector, CRUISER, in which a concurrent thread is added to the user program to monitor heap integrity, and custom lock-free data structures and algorithms ...
are designed to achieve high efficiency and scalability. ...
Michael for pointing to us the open source project "Amino Concurrent Building Blocks" [46] , Andrew Appel and Xi Xiong for their valuable comments, and the anonymous reviewers for their comments that ...
doi:10.1145/1993316.1993541
fatcat:prz4c6hjbjbdrd6mk3bonb2aam
Cruiser
2011
Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation - PLDI '11
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 2017; you can also visit the original URL.
The file type is application/pdf.
We present a concurrent heap buffer overflow detector, CRUISER, in which a concurrent thread is added to the user program to monitor heap integrity, and custom lock-free data structures and algorithms ...
are designed to achieve high efficiency and scalability. ...
Michael for pointing to us the open source project "Amino Concurrent Building Blocks" [46] , Andrew Appel and Xi Xiong for their valuable comments, and the anonymous reviewers for their comments that ...
doi:10.1145/1993498.1993541
dblp:conf/pldi/ZengWL11
fatcat:juqbijtbwfg23l64ueduhmfzcm
Progress guarantee for parallel programs via bounded lock-freedom
2009
SIGPLAN notices
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.
A composition theorem asserts that bounded lock-free algorithms running on bounded lock-free supporting systems retain bounded lock-freedom for the composed execution. ...
We concentrate on lock-freedom and propose a variant of it denoted bounded lock-freedom, which is more suitable for guaranteeing progress in practical systems. ...
Acknowledgement We thank Roy Friedman, Tim Harris, Maurice Herlihy, Victor Luchangco, Maged Michael, Mark Moir, Nir Shavit, and David Tarditi for many helpful discussions. ...
doi:10.1145/1543135.1542493
fatcat:h5x37k4hazbsbp6hosmed5f7ke
Progress guarantee for parallel programs via bounded lock-freedom
2009
Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation - PLDI '09
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.
A composition theorem asserts that bounded lock-free algorithms running on bounded lock-free supporting systems retain bounded lock-freedom for the composed execution. ...
We concentrate on lock-freedom and propose a variant of it denoted bounded lock-freedom, which is more suitable for guaranteeing progress in practical systems. ...
Acknowledgement We thank Roy Friedman, Tim Harris, Maurice Herlihy, Victor Luchangco, Maged Michael, Mark Moir, Nir Shavit, and David Tarditi for many helpful discussions. ...
doi:10.1145/1542476.1542493
dblp:conf/pldi/PetrankMS09
fatcat:nffg4nxd3rdffbv3koscf5gaae
Boosting Multi-Core Reachability Performance with Shared Hash Tables
[article]
2010
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
This paper focuses on data structures for multi-core reachability, which is a key component in model checking algorithms and other verification methods. ...
Our implementation outperforms two state-of-the-art multi-core model checkers (SPIN and DiVinE) by a substantial margin, while placing fewer constraints on the load balancing and search algorithms. ...
We thank Petr Ročkai and Jiří Barnat for the help and support they provided on the DiVinE toolkits. ...
arXiv:1004.2772v2
fatcat:ugbtlnibizefzgmp5g2ynxi244
DCAS is not a silver bullet for nonblocking algorithm design
2004
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures - SPAA '04
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.
That is, it does not make the design and verification of even mundane nonblocking data structures with desirable properties easy. ...
Therefore, our position is that while slightly more powerful synchronisation primitives can have a profound effect on ease of algorithm design and verification, DCAS does not provide sufficient additional ...
CONCLUDING REMARKS We have argued that DCAS does not provide a "silver bullet" for nonblocking algorithms and data structures: algorithms based on DCAS share many of the disadvantages of previous algorithms ...
doi:10.1145/1007912.1007945
dblp:conf/spaa/DohertyDGFLMMSS04
fatcat:76owq5bkbbhsrecsm7njsluigu
Making Lock-free Data Structures Verifiable with Artificial Transactions
2016
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 2017; you can also visit the original URL.
The file type is application/pdf.
Among all classes of parallel programming abstractions, lock-free data structures are considered one of the most scalable and efficient because of their fine-grained style of synchronization. ...
Evaluation on six popular lock-free data structures shows that TXIT makes it easy to verify lock-free data structures while incurring acceptable runtime overhead. ...
Figure 1 : 1 A lock-free stack (a) and its test case (b).
Figure 2 : 2 A schedule causing a double-free error. ...
doi:10.1145/2883591.2883603
fatcat:er4v433zqjcyfazm62zx52vlpa
Making lock-free data structures verifiable with artificial transactions
2015
Proceedings of the 8th Workshop on Programming Languages and Operating Systems - PLOS '15
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 2017; you can also visit the original URL.
The file type is application/pdf.
Among all classes of parallel programming abstractions, lock-free data structures are considered one of the most scalable and efficient because of their fine-grained style of synchronization. ...
Evaluation on six popular lock-free data structures shows that TXIT makes it easy to verify lock-free data structures while incurring acceptable runtime overhead. ...
Figure 1 : 1 A lock-free stack (a) and its test case (b).
Figure 2 : 2 A schedule causing a double-free error. ...
doi:10.1145/2818302.2818309
dblp:conf/sosp/YuanWYS15
fatcat:62beyourzva45jmvja35jzd5ue
Zing: A Model Checker for Concurrent Software
[chapter]
2004
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 2019; you can also visit the original URL.
The file type is application/pdf.
Building a scalable model checker for the zing modeling language is a huge challenge since the states of a zing model have complicated features such as processes, heap and stack. ...
A zing state comprises the thread stacks, the global variables, and a heap of dynamically allocated objects. ...
doi:10.1007/978-3-540-27813-9_42
fatcat:ma7l3y7mgndtldki2jmv3wuntm
The Lock-free k-LSM Relaxed Priority Queue
[article]
2015
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.
We present a new, lock-free priority queue that relaxes the delete-min operation so that it is allowed to delete any of the ρ+1 smallest keys, where ρ is a runtime configurable parameter. ...
We experimentally compare our priority queue to recent state-of-the-art lock-free priority queues, both with relaxed and non-relaxed semantics, showing high performance and good scalability of our approach ...
Performance-and scalability-wise it is competitive to other, recent, lock-free relaxed priority queues. ...
arXiv:1503.05698v1
fatcat:7g5wbzeyo5eypffi266wr4ta7e
Scalable deterministic replay in a parallel full-system emulator
2013
Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '13
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 2017; you can also visit the original URL.
The file type is application/pdf.
Third, ReEmu adopts an automatic lock clustering mechanism that clusters a set of uncontended memory objects to a bulk to reduce the frequencies of lock operations, which noticeably boost performance. ...
Our prototype ReEmu is based on our open-source COREMU system and supports scalable and efficient record and replay of fullsystem environments (both x64 and ARM). ...
Third, there is only one lock to serialize multiple writers and the read side is completely lock-free. ...
doi:10.1145/2442516.2442537
dblp:conf/ppopp/ChenC13
fatcat:gnmzqcfq45cszeuop5jy6fqxjq
A lock-free algorithm for concurrent bags
2011
Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11
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 2017; you can also visit the original URL.
The file type is application/pdf.
A lock-free bag data structure supporting unordered buffering is presented in this paper. The algorithm supports multiple producers and multiple consumers, as well as dynamic collection sizes. ...
Therefore, the algorithm exploits a distributed design combined with novel techniques for handling concurrent modifications of linked lists using double marks, detection of total emptiness, and efficient ...
Its design aims at allowing high scalability and is also apparently lock-free (although not explicitly stated in the paper), but not linearizable (e.g. it lacks a global state indicating emptiness). ...
doi:10.1145/1989493.1989550
dblp:conf/spaa/SundellGPT11
fatcat:fpssyzxsyralpiudxy53fjmy3e
« Previous
Showing results 1 — 15 out of 3,012 results