Store Buffer Reduction in the Presence of Mixed-Size Accesses and Misalignment

Oberhauser, Jonas

doi:10.1007/978-3-030-03592-1_19

Cited by 1 publication

(1 citation statement)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Programs that follow such a discipline are robust, meaning that they have only sequentially consistent behaviors on the underlying weak memory model. While there is a rich literature on programming disciplines that imply robustness and verification techniques for robustness [Bouajjani et al 2013[Bouajjani et al , 2018[Bouajjani et al , 2011Derevenetc and Meyer 2014;Lahav and Margalit 2019;Margalit and Lahav 2021;Oberhauser 2018], most work only considers finite behaviors, i.e., they leave open whether programs following the discipline have only sequentially consistent infinite behaviors. This means that any correctness properties that only concern infinite behaviors, such as starvation-freedom, might be lost on the weak memory model despite its (finite) robustness.…”

Section: From Finite To Infinite Robustnessmentioning

confidence: 99%

Making weak memory models fair

Lahav

Namakonov

Oberhauser

et al. 2021

Proc. ACM Program. Lang.

Self Cite

View full text Add to dashboard Cite

Liveness properties, such as termination, of even the simplest shared-memory concurrent programs under sequential consistency typically require some fairness assumptions about the scheduler. Under weak memory models, we observe that the standard notions of thread fairness are insufficient, and an additional fairness property, which we call memory fairness, is needed. In this paper, we propose a uniform definition for memory fairness that can be integrated into any declarative memory model enforcing acyclicity of the union of the program order and the reads-from relation. For the well-known models, SC, x86-TSO, RA, and StrongCOH, that have equivalent operational and declarative presentations, we show that our declarative memory fairness condition is equivalent to an intuitive model-specific operational notion of memory fairness, which requires the memory system to fairly execute its internal propagation steps. Our fairness condition preserves the correctness of local transformations and the compilation scheme from RC11 to x86-TSO, and also enables the first formal proofs of termination of mutual exclusion lock implementations under declarative weak memory models.

show abstract

Section: From Finite To Infinite Robustnessmentioning

confidence: 99%