We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Fast and scalable rendezvousing.
- Authors
Afek, Yehuda; Hakimi, Michael; Morrison, Adam
- 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.
- Subjects
ELIMINATION (Mathematics); ALGEBRA; EQUATIONS; BINARY operations; SUBSTITUTIONS (Mathematics)
- Publication
Distributed Computing, 2013, Vol 26, Issue 4, p243
- ISSN
0178-2770
- Publication type
Article
- DOI
10.1007/s00446-013-0185-0