Distributed Computing

, Volume 26, Issue 4, pp 243–269

Fast and scalable rendezvousing

Article

DOI: 10.1007/s00446-013-0185-0

Cite this article as:
Afek, Y., Hakimi, M. & Morrison, A. Distrib. Comput. (2013) 26: 243. doi:10.1007/s00446-013-0185-0

Abstract

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.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  1. 1.Blavatnik School of Computer ScienceTel Aviv UniversityTel AvivIsrael

Personalised recommendations