Fast and Scalable Rendezvousing

  • Yehuda Afek
  • Michael Hakimi
  • Adam Morrison
Conference paper

DOI: 10.1007/978-3-642-24100-0_2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6950)
Cite this paper as:
Afek Y., Hakimi M., Morrison A. (2011) Fast and Scalable Rendezvousing. In: Peleg D. (eds) Distributed Computing. DISC 2011. Lecture Notes in Computer Science, vol 6950. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Yehuda Afek
    • 1
  • Michael Hakimi
    • 1
  • Adam Morrison
    • 1
  1. 1.School of Computer ScienceTel Aviv UniversityIsrael

Personalised recommendations