FlowPools: A Lock-Free Deterministic Concurrent Dataflow Abstraction – Proofs

Implementing correct and deterministic parallel programs is challenging. Even though concurrency constructs exist in popular pro- gramming languages to facilitate the task of deterministic parallel pro- gramming, they are often too low level, or do not compose well due to underlying blocking mechanisms. In this report, we present the detailed proofs of the linearizability, lock- freedom, and determinism properties of FlowPools, a deterministic concurrent dataflow abstraction presented in [1].


Année
2012
Mots-clefs:
Laboratoires:




 Notice créée le 2012-08-31, modifiée le 2018-03-17

n/a:
Télécharger le document
PDF

Évaluer ce document:

Rate this document:
1
2
3
 
(Pas encore évalué)