High-throughput query scheduling with spatial clustering based on distributed exponential moving average

  • Authors:

  • Beomseok Nam;Deukyeon Hwang;Jinwoong Kim;Minho Shin

  • Affiliations:

  • Electrical and Computer Engineering, Ulsan National Inst. of Science and Technology, Ulsan, Korea 689-798;Electrical and Computer Engineering, Ulsan National Inst. of Science and Technology, Ulsan, Korea 689-798;Electrical and Computer Engineering, Ulsan National Inst. of Science and Technology, Ulsan, Korea 689-798;Dept. of Computer Engineering, Myongji University, Yongin, Korea

  • Venue:
  • Distributed and Parallel Databases
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In distributed scientific query processing systems, leveraging distributed cached data is becoming more important. In such systems, a front-end query scheduler distributes queries among many application servers rather than processing queries in a few high-performance workstations. Although many query scheduling policies exist such as round-robin and load-monitoring, they are not sophisticated enough to exploit cached results as well as balance the workload. Efforts were made to improve the query processing performance using statistical methods such as exponential moving average. However, existing methods have limitations for certain query patterns: queries with hotspots, or dynamic query distributions. In this paper, we propose novel query scheduling policies that take into account both the contents of distributed caching infrastructure and the load balance among the servers. Our experiments show that the proposed query scheduling policies outperform existing policies by producing better query plans in terms of load balance and cache-hit ratio.