Write a Blog >>
Mon 24 Feb 2020 14:50 - 15:15 - Concurrent Data Structures (Mediterranean Ballroom) Chair(s): Michael Scott

Data sketches are approximate succinct summaries of long data streams. They are widely used for processing massive amounts of data and answering statistical queries about it. Existing libraries producing sketches are very fast, but do not allow parallelism for creating sketches using multiple threads or querying them while they are being built. We present a generic approach to parallelising data sketches efficiently and allowing them to be queried in real time, while bounding the error that such parallelism introduces. Utilising relaxed semantics and the notion of strong linearisability we prove our algorithm’s correctness and analyse the error it induces in two specific sketches. Our implementation achieves high scalability while keeping the error small. We have contributed one of our concurrent sketches to the open-source data sketches library.

Mon 24 Feb
Times are displayed in time zone: Tijuana, Baja California change

14:00 - 15:40
Concurrent Data Structures (Mediterranean Ballroom)Main Conference
Chair(s): Michael Scott
14:00
25m
Talk
Scaling Concurrent Queues by Using HTM to Profit from Failed Atomic Operations
Main Conference
Or OstrovskyTel Aviv University, Adam MorrisonTel Aviv University
14:25
25m
Talk
A Wait-Free Universal Construct for Large Objects
Main Conference
Andreia CorreiaUniversity of Neuchâtel, Pedro Ramalhete, Pascal FelberUniversité de Neuchâtel
14:50
25m
Talk
Fast Concurrent Data Sketches
Main Conference
Arik RinbergTechnion, Alexander SpiegelmanVMware Research, Edward BortnikovYahoo Research, Eshcar HillelYahoo Research, Oath, Idit KeidarTechnion - Israel institute of technology, Hadar ServianskyWeizmann, Lee RhodesVerizon Media
15:15
25m
Talk
Universal Wait-Free Memory Reclamation
Main Conference
Ruslan NikolaevVirginia Tech, Binoy RavindranVirginia Tech