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
Detectable Sequential Specifications for Recoverable Shared Objects
2021
Preserved Fulltext
sequential specifications combined with a novel correctness condition. ...
need for detectability, and then perform detection if needed after a failure. ...
Conclusion In this paper, we introduced the detectable sequential specification (DSS) as a formal definition of detectability for recoverable objects. ...
doi:10.4230/lipics.disc.2021.29
fatcat:mwhqmrvr6vgxbans5xrdhukium
Upper and Lower Bounds on the Space Complexity of Detectable Object
[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.
Finally, we prove that the following holds for obstruction-free detectable implementations of a large class of objects: their recoverable operations must be provided with auxiliary state– state that is ...
Of particular interest are recoverable algorithms that, in addition to ensuring object consistency, also provide detectability, a correctness condition requiring that the recovery code can infer if the ...
Several previous works investigated recoverable implementations for specific data-structures. Friedman et al. ...
arXiv:2002.11378v1
fatcat:k2pvagbfizdqdmcnuciihg3m54
Delay-Free Concurrency on Faulty Persistent Memory
[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.
Other Versions
We show this first for a simple transformation, and then present optimizations to make it more practical, allowing for a tradeoff for better constant factors in computational delay, for sometimes increased ...
In this paper, we present a construction that takes any concurrent program with reads, writes and CASs to shared memory and makes it persistent, i.e., can be continued after one or more processes fault ...
., we treat the recovery function as another operation of the recoverable CAS object, whose sequential specification is as follows. ...
arXiv:1806.04780v3
fatcat:bd2ccf6wdjenbdckm4jyyj742m
Persistent Software Combining
[article]
2022
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 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We built recoverable queues and stacks, based on PBcomb and PWFcomb, and present experiments to show that they have much better performance than previous recoverable implementations of stacks and queues ...
We built fundamental recoverable data structures, such as stacks and queues based on PBcomb, as well as on PWFcomb, a wait-free universal construction we present. ...
Specifically, they prove that for a specific class of objects (which include FIFO queues, considered in this paper), any obstruction-free detectable implementation must receive auxiliary state. ...
arXiv:2107.03492v3
fatcat:o24nz2z5zzb2vpd5fqtzsdblke
Data-race exceptions have benefits beyond the memory model
2011
Proceedings of the 2011 ACM SIGPLAN Workshop on Memory Systems Performance and Correctness - MSPC '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.
However, the high cost of precise race detection has kept the cost-to-benefit ratio of data-race exceptions too high for widespread adoption. ...
Proposals to treat data races as exceptions provide simplified semantics for shared-memory multithreaded programming languages and memory models by guaranteeing that execution remains data-race-free and ...
exceptions for performance, simplicity, and power in new applications, and the programmability benefits of sequential consistency. ...
doi:10.1145/1988915.1988923
dblp:conf/pldi/WoodCG11
fatcat:btchrf4qfzewxgu2shahzuvvua
Benchmarking the effectiveness of sequential pattern mining methods
2007
Data & Knowledge Engineering
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 2008; you can also visit the original URL.
The file type is application/pdf.
The study suggests that the alignment model will give a good summary of the sequential data in the form of a set of common patterns in the data. ...
Here we propose a novel benchmarking criteria that can systematically evaluate the effectiveness of any sequential pattern mining method under a variety of situations. ...
A good sequential pattern mining algorithm should be able to detect the general trend shared across these similar sequences in the presence of noise. ...
doi:10.1016/j.datak.2006.01.004
fatcat:vimlb5574ndcpccykrahacabuy
Hardware-Transactional-Memory Based Speculative Parallel Discrete Event Simulation of Very Fine Grain Models
2015
2015 IEEE 22nd International Conference on High Performance Computing (HiPC)
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.
) facilities for the purpose of state recoverability. ...
In this proposal, the speculative updates on the state of the simulation model are executed as concurrent HTM-based transactions that are also in charge of detecting whether the update is consistent with ...
a specific simulation object. ...
doi:10.1109/hipc.2015.45
dblp:conf/hipc/SantiniI0Q15
fatcat:zemym4p4rfgxta5wh62xrtm7ja
NUMA Time Warp
2015
Proceedings of the 3rd ACM Conference on SIGSIM-Principles of Advanced Discrete Simulation - SIGSIM-PADS '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.
any recoverability data. ...
binding of the memory pages reserved for an individual object to the different NUMA nodes, depending on what worker thread is in charge of running that simulation object along a given wall-clock-time window ...
live state of the object and for state recoverability data. ...
doi:10.1145/2769458.2769479
dblp:conf/pads/PellegriniQ15a
fatcat:2y5rfnzh2rc2vnlwx5jcd75ddm
Sequential Pattern Mining in Multi-Databases via Multiple Alignment
2006
Data mining and knowledge discovery
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 propose the theme of approximate sequential pattern mining roughly defined as identifying patterns approximately shared by many sequences. ...
In this paper, we present an alternative local mining approach for finding sequential patterns in the local databases of a multi-database. ...
Recoverability is a weighted measure that provides a good estimation of how much of the items in the base patterns were detected. ...
doi:10.1007/s10618-005-0017-3
fatcat:relv7cwihnh4ddhoz5jhsrdzt4
Specification and implementation of resilient, atomic data types
1983
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 suggest addressing this problem by implementing applications in terms of abstract data types with two properties: Their objects are atomic (they provide serializability and recoverability for activities ...
We define what it means for abstract data types to be atomic and resilient. ...
The processes within a guardian can share the objects directly, but sharing of objects between guardians is not permitted. ...
doi:10.1145/872728.806851
fatcat:4yudaenjwbfcdnjkmd46axglgi
Specification and implementation of resilient, atomic data types
1983
Proceedings of the 1983 ACM SIGPLAN symposium on Programming language issues in software systems - SIGPLAN '83
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 suggest addressing this problem by implementing applications in terms of abstract data types with two properties: Their objects are atomic (they provide serializability and recoverability for activities ...
We define what it means for abstract data types to be atomic and resilient. ...
The processes within a guardian can share the objects directly, but sharing of objects between guardians is not permitted. ...
doi:10.1145/800226.806851
fatcat:xql2zzbgqnbe3ecozsvza6byu4
Toward Linearizability Testing for Multi-Word Persistent Synchronization Primitives
2020
International Conference on Principles of Distributed Systems
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.
This research focuses specifically on the algorithmic principles of software testing, particularly linearizability analysis, for multi-word persistent synchronization primitives such as conditional swap ...
We describe an efficient decision procedure for linearizability in this context, and discuss its practical applications in detecting previously-unknown bugs in implementations of multi-word persistent ...
Figure 1 1 Sequential specification of multi-word Compare-And-Swap (MwCAS). ...
doi:10.4230/lipics.opodis.2019.19
dblp:conf/opodis/CepedaCLLWG19
fatcat:ycssxm7xwvhq7g4qx6skoy7u6q
Distributed transactions for reliable systems
1985
Proceedings of the tenth ACM symposium on Operating systems principles - SOSP '85
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.
Objects vary in their lifetimes and their implementation. The notion of object presented here is II A ...
A queue object having Operations such as Enqueue, Dequeue, EmptyQueue is a typical data object, and a CRT display having operations such as WriteLine, and ReadLine is a typical I/0 object. ...
Sherri Menees provided editorial assistance for this paper, and Maurice Herlihy, David Nichols, and Rick Rashid provided helpful comments. ...
doi:10.1145/323647.323641
dblp:conf/sosp/SpectorDDEP85
fatcat:ipwpgynrmrcv5bhs3t2gh4fqiy
Distributed transactions for reliable systems
1985
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.
Objects vary in their lifetimes and their implementation. The notion of object presented here is II A ...
A queue object having Operations such as Enqueue, Dequeue, EmptyQueue is a typical data object, and a CRT display having operations such as WriteLine, and ReadLine is a typical I/0 object. ...
Sherri Menees provided editorial assistance for this paper, and Maurice Herlihy, David Nichols, and Rick Rashid provided helpful comments. ...
doi:10.1145/323627.323641
fatcat:im54sr7pwzgplg4ebfyggjcvxm
Transparently Mixing Undo Logs and Software Reversibility for State Recovery in Optimistic PDES
2015
Proceedings of the 3rd ACM Conference on SIGSIM-Principles of Advanced Discrete Simulation - SIGSIM-PADS '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.
In this paper, we explore the practical design and implementation of a state recoverability technique which allows to restore a previous simulation state either relying on checkpointing or on the reverse ...
This configuration file instructs Hijacker to generate a modified application-level relocatable object which has two different versions (as pointed out, sharing the same data). ...
For completeness, we also report the execution times for the case of a serial execution of the same identical configurations on top of a calendar queuebased sequential scheduler [5] , to confirm that ...
doi:10.1145/2769458.2769482
dblp:conf/pads/CingolaniPQ15
fatcat:hwcyu274xjf7bmkhvb5hqssfgq
« Previous
Showing results 1 — 15 out of 2,962 results