Summary: Fast and Scalable Rendezvousing
Yehuda Afek Michael Hakimi Adam Morrison
School of Computer Science
Tel Aviv University
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). It is a fast matching machine. Consequently, we also present a highly scalable
and competitive stack implementation.
Intended for Regular Presentation.
Eligible for Best Student Paper Award.