Deadline Queries: Using Elastic MapReduce to Produce On-Time Results

Authors

Abstract

MapReduce has become a widely used tool for computing complex tasks that process massive amounts of data in large clusters. These tasks commonly execute on a fraction of the nodes of a larger cluster, and it is left to users to make best guesses on the number of nodes needed for a task to complete within acceptable time. Nonetheless, the time a task will take to complete is often unknown beforehand. Previous research addressed this problem by establishing time constraints for query execution and, when needed, reduce the accuracy of queries using result approximation and/or sampling. However in many situations reduced accuracy is not tolerable. In this paper we present FloodDQ, a MapReduce system that implements deadline queries?queries that must finish before a deadline, never discarding data or reducing accuracy. FloodDQ produces timely, accurate results by adaptively increasing or decreasing computing power, at runtime, towards completing execution within the specified deadline. In FloodDQ, users only specify a deadline and the input data. The system monitors the progress of the task and extrapolates whether it will complete on time. If the task is deemed to complete after the specified time, the system requests more nodes from an Infrastructure-as-a-Service provider, and adds them to the computation. On the other hand, if the task is deemed to complete before the specified time the system quiesces and releases surplus nodes, cutting costs to a minimum. This paper describes FloodDQ?s architecture for supporting deadline queries and presents experimental results where the system always meets the deadline in spite of changes to the number of nodes, size of data or existence of perturbations.

Keywords

Deadline queries, elastic scalability.

Subject

Elastic Scalability