TY - GEN

T1 - Low contention linearizable counting

AU - Herlihy, Maurice

AU - Shavit, Nir

AU - Waarts, Orli

PY - 1991/12

Y1 - 1991/12

N2 - The linearizable counting problem requires asynchronous concurrent processes to assign themselves successive values so that the order of the values assigned reflects the real-time order in which they were requested. It is shown that the problem can be solved without funneling all processes through a common memory location. Two new constructions for linearizable counting networks, data structures that solve the linearizable counting problem, are given. The first construction is nonblocking: some process takes a value after O(n) network gates have been traversed. The second construction is wait-free: it guarantees that each process takes a value after it traverses O(wn) gates, where w is a parameter affecting contention. It is shown that in any non-blocking or wait-free linearizable counting network, processes must traverse an average of Ω(n) gates, and so the constructions are close to optimal. A simpler and more efficient network is constructed by giving up the robustness requirements and allowing processes to wait for one another.

AB - The linearizable counting problem requires asynchronous concurrent processes to assign themselves successive values so that the order of the values assigned reflects the real-time order in which they were requested. It is shown that the problem can be solved without funneling all processes through a common memory location. Two new constructions for linearizable counting networks, data structures that solve the linearizable counting problem, are given. The first construction is nonblocking: some process takes a value after O(n) network gates have been traversed. The second construction is wait-free: it guarantees that each process takes a value after it traverses O(wn) gates, where w is a parameter affecting contention. It is shown that in any non-blocking or wait-free linearizable counting network, processes must traverse an average of Ω(n) gates, and so the constructions are close to optimal. A simpler and more efficient network is constructed by giving up the robustness requirements and allowing processes to wait for one another.

UR - http://www.scopus.com/inward/record.url?scp=0026372367&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0026372367

SN - 0818624450

T3 - Annual Symposium on Foundations of Computer Science (Proceedings)

SP - 526

EP - 535

BT - Annual Symposium on Foundations of Computer Science (Proceedings)

PB - Publ by IEEE

T2 - Proceedings of the 32nd Annual Symposium on Foundations of Computer Science

Y2 - 1 October 1991 through 4 October 1991

ER -