TY - GEN
T1 - Fast and scalable rendezvousing
AU - Afek, Yehuda
AU - Hakimi, Michael
AU - Morrison, Adam
PY - 2011
Y1 - 2011
N2 - In an asymmetric rendezvous system, such as an unfair synchronous queue and 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 a new highly scalable, high throughput asymmetric rendezvous system that outperforms prior synchronous queue and elimination array implementations under both symmetric and asymmetric workloads (more operations of one type than the other). Consequently, we also present a highly scalable elimination-based stack.
AB - In an asymmetric rendezvous system, such as an unfair synchronous queue and 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 a new highly scalable, high throughput asymmetric rendezvous system that outperforms prior synchronous queue and elimination array implementations under both symmetric and asymmetric workloads (more operations of one type than the other). Consequently, we also present a highly scalable elimination-based stack.
UR - http://www.scopus.com/inward/record.url?scp=80055037993&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-24100-0_2
DO - 10.1007/978-3-642-24100-0_2
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:80055037993
SN - 9783642240997
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 16
EP - 31
BT - Distributed Computing - 25th International Symposium, DISC 2011, Proceedings
T2 - 25th International Symposium on Distributed Computing, DISC 2011
Y2 - 20 September 2011 through 22 September 2011
ER -