KIT | KIT-Bibliothek | Impressum | Datenschutz

Communication Efficient Checking of Big Data Operations

Hübschle-Schneider, Lorenz 1; Sanders, Peter ORCID iD icon 1
1 Institut für Theoretische Informatik (ITI), Karlsruher Institut für Technologie (KIT)

Abstract (englisch):

We propose fast probabilistic algorithms with low (i.e., sublinear in the input size) communication volume to check the correctness of operations in Big Data processing frameworks and distributed databases. Our checkers cover many of the commonly used operations, including sum, average, median, and minimum aggregation, as well as sorting, union, merge, and zip. An experimental evaluation of our implementation in Thrill (Bingmann et al., 2016) confirms the low overhead and high failure detection rate predicted by theoretical analysis.

Postprint §
DOI: 10.5445/IR/1000085585
DOI: 10.1109/IPDPS.2018.00074
Zitationen: 2
Cover der Publikation
Zugehörige Institution(en) am KIT Institut für Theoretische Informatik (ITI)
Publikationstyp Proceedingsbeitrag
Publikationsdatum 21.05.2018
Sprache Englisch
Identifikator ISBN: 978-1-5386-4369-3
KITopen-ID: 1000085585
HGF-Programm 46.12.02 (POF III, LK 01) Data Activities
Erschienen in 32nd IEEE International Parallel and Distributed Processing Symposium (IPDPS), Vancouver, BC, Canada, 21-25 May 2018
Verlag Institute of Electrical and Electronics Engineers (IEEE)
Seiten 650–659
Schlagwörter certifying algorithms, checking computation, communication efficiency, data-parallel, probabilistic algorithms
Nachgewiesen in Dimensions
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft
KITopen Landing Page