TY - JOUR
T1 - Fast and scalable rendezvousing
AU - Afek, Yehuda
AU - Hakimi, Michael
AU - Morrison, Adam
PY - 2013/8
Y1 - 2013/8
N2 - In an asymmetric rendezvous system, such as an unfair synchronous queue or an elimination array, threads of two types, consumers and producers, show up and are matched each with a unique thread of the other type. Here we present new highly scalable, high throughput asymmetric rendezvous systems that outperform prior synchronous queue and elimination array implementations under both symmetric and asymmetric workloads (more operations of one type than the other). Based on this rendezvous system, we also construct a highly scalable and competitive stack implementation.
AB - In an asymmetric rendezvous system, such as an unfair synchronous queue or an elimination array, threads of two types, consumers and producers, show up and are matched each with a unique thread of the other type. Here we present new highly scalable, high throughput asymmetric rendezvous systems that outperform prior synchronous queue and elimination array implementations under both symmetric and asymmetric workloads (more operations of one type than the other). Based on this rendezvous system, we also construct a highly scalable and competitive stack implementation.
UR - http://www.scopus.com/inward/record.url?scp=84880919052&partnerID=8YFLogxK
U2 - 10.1007/s00446-013-0185-0
DO - 10.1007/s00446-013-0185-0
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84880919052
SN - 0178-2770
VL - 26
SP - 243
EP - 269
JO - Distributed Computing
JF - Distributed Computing
IS - 4
ER -