Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming 2022
DOI: 10.1145/3503221.3508426
|View full text |Cite
|
Sign up to set email alerts
|

The performance power of software combining in persistence

Abstract: The availability of Non-Volatile Main Memory (known as NVMM) enables the design of recoverable concurrent algorithms. We study the power of software combining in achieving recoverable synchronization and designing persistent data structures. Software combining is a general synchronization approach, which attempts to simulate the ideal world when executing synchronization requests (i.e., requests that must be executed in mutual exclusion). A single thread, called the combiner, executes all active requests, whil… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
1
1

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 52 publications
0
5
0
Order By: Relevance
“…In this paper, we studied solvability, without considering efficiency. A lot of research has focused on designing efficient recoverable transactional memory systems [4, 7-9, 31, 33]) and recoverable universal constructions [11,14]. Wait-free solutions appear in [11,14,31].…”
Section: Discussionmentioning
confidence: 99%
See 4 more Smart Citations

When Is Recoverable Consensus Harder Than Consensus?

Delporte-Gallet,
Fatourou,
Fauconnier
et al. 2022
Preprint
Self Cite
“…In this paper, we studied solvability, without considering efficiency. A lot of research has focused on designing efficient recoverable transactional memory systems [4, 7-9, 31, 33]) and recoverable universal constructions [11,14]. Wait-free solutions appear in [11,14,31].…”
Section: Discussionmentioning
confidence: 99%
“…A lot of research has focused on designing efficient recoverable transactional memory systems [4, 7-9, 31, 33]) and recoverable universal constructions [11,14]. Wait-free solutions appear in [11,14,31]. Some [11,14] are based on existing wait-free universal constructions [12,13] for the standard shared-memory model with halting failures.…”
Section: Discussionmentioning
confidence: 99%
See 3 more Smart Citations

When Is Recoverable Consensus Harder Than Consensus?

Delporte-Gallet,
Fatourou,
Fauconnier
et al. 2022
Preprint
Self Cite