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
.
Phase-concurrent hash tables for determinism
2014
Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures - SPAA '14
We present a deterministic phase-concurrent hash table in which operations of the same type are allowed to proceed concurrently, but operations of different types are not. Phase-concurrency guarantees that all concurrent operations commute, giving a deterministic hash table state, guaranteeing that the state of the table at any quiescent point is independent of the ordering of operations. Furthermore, by restricting our hash table to be phase-concurrent, we show that we can support operations
doi:10.1145/2612669.2612687
dblp:conf/spaa/ShunB14
fatcat:ywjhokjs6zd3rllzk5uiive6b4