Scalable Flat-Combining Based Synchronous Queues

13 years 2 months ago

Download www.cs.bgu.ac.il

In a synchronous queue, producers and consumers handshake to exchange data. Recently, new scalable unfair synchronous queues were added to the Java JDK 6.0 to support high performance thread pools. This paper applies ﬂat-combining to the problem of designing a synchronous queue algorithm. We ﬁrst use the original ﬂat-combining algorithm, a single “combiner” thread acquires a global lock and services the other threads’ combined requests with very low synchronization overheads. As we show, this single combiner approach delivers superior performance up to a certain level of concurrency, but unfortunately does not continue to scale beyond that point. In order to continue to deliver scalable performance as concurrency increases, we introduce a new parallel ﬂat-combining algorithm. The new algorithm dynamically adds additional concurrently executing ﬂat-combiners that coordinate their work. It enjoys the low coordination overheads of sequential ﬂat combining, with the added...

Danny Hendler, Itai Incze, Nir Shavit, Moran Tzafr

Real-time Traffic