Fast and scalable rendezvousing

Yehuda Afek*, Michael Hakimi, Adam Morrison

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageEnglish
Title of host publicationDistributed Computing - 25th International Symposium, DISC 2011, Proceedings
Number of pages16
StatePublished - 2011
Event25th International Symposium on Distributed Computing, DISC 2011 - Rome, Italy
Duration: 20 Sep 201122 Sep 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6950 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference25th International Symposium on Distributed Computing, DISC 2011


Dive into the research topics of 'Fast and scalable rendezvousing'. Together they form a unique fingerprint.

Cite this