SIDR: structure-aware intelligent data routing in Hadoop

  • Authors:
  • Joe Buck;Noah Watkins;Greg Levin;Adam Crume;Kleoni Ioannidou;Scott Brandt;Carlos Maltzahn;Neoklis Polyzotis;Aaron Torres

  • Affiliations:
  • University of California - Santa Cruz;University of California - Santa Cruz;University of California - Santa Cruz;University of California - Santa Cruz;University of California - Santa Cruz;University of California - Santa Cruz;University of California - Santa Cruz;University of California - Santa Cruz;Los Alamos National Laboratory

  • Venue:
  • SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

The MapReduce framework is being extended for domains quite different from the web applications for which it was designed, including the processing of big structured data, e.g., scientific and financial data. Previous work using MapReduce to process scientific data ignores existing structure when assigning intermediate data and scheduling tasks. In this paper, we present a method for incorporating knowledge of the structure of scientific data and executing query into the MapReduce communication model. Built in SciHadoop, a version of the Hadoop MapReduce framework for scientific data, SIDR intelligently partitions and routes intermediate data, allowing it to: remove Hadoop's global barrier and execute Reduce tasks prior to all Map tasks completing; minimize intermediate key skew; and produce early, correct results. SIDR executes queries up to 2.5 times faster than Hadoop and 37% faster than SciHadoop; produces initial results with only 6% of the query completed; and produces dense, contiguous output.