000181098 001__ 181098
000181098 005__ 20190316235453.0
000181098 037__ $$aREP_WORK
000181098 245__ $$aFlowPools: A Lock-Free Deterministic Concurrent Dataflow Abstraction – Proofs
000181098 269__ $$a2012
000181098 260__ $$c2012
000181098 300__ $$a32
000181098 336__ $$aReports
000181098 520__ $$aImplementing 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].
000181098 6531_ $$adataflow, concurrent, lock-free, data-structure, deterministic, parallelism
000181098 700__ $$0244134$$aProkopec, Aleksandar$$g191413
000181098 700__ $$0242185$$aMiller, Heather$$g191683
000181098 700__ $$0240993$$aHaller, Philipp$$g172057
000181098 700__ $$0247866$$aSchlatter, Tobias$$g184229
000181098 700__ $$0241835$$aOdersky, Martin$$g126003
000181098 8564_ $$s427381$$uhttps://infoscience.epfl.ch/record/181098/files/proofs.pdf$$yn/a$$zn/a
000181098 909C0 $$0252187$$pLAMP$$xU10409
000181098 909CO $$ooai:infoscience.tind.io:181098$$pIC$$preport$$qGLOBAL_SET
000181098 917Z8 $$x191683
000181098 937__ $$aEPFL-REPORT-181098
000181098 973__ $$aEPFL$$sPUBLISHED
000181098 980__ $$aREPORT