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
.
The concurrency hierarchy, and algorithms for unbounded concurrency
2001
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing - PODC '01
We study walt-free computation using (read/write) shared memory under a range of assumptions on the arrival pattern of processes. We distinguish first between bounded and infinite arrival patterns, and further distinguish these models by restricting the number of arrivals minus departures, the concurrency. Under the condition that no process takes infinitely many steps without terminating, for any finite bound k > 0, we show that bounding concurrency reveals a strict hierarchy of computational
doi:10.1145/383962.384008
dblp:conf/podc/GafniMT01
fatcat:5g7poiutiffbnaqxjfq5wwpsha