Intelligent data staging with overlapped execution of grid applications

  • Authors:
  • Yuya Machida;Shin'ichiro Takizawa;Hidemoto Nakada;Satoshi Matsuoka

  • Affiliations:
  • Tokyo Institute of Technology, 2-12-1 Ookayama, Tokyo, 152-8550, Japan;Tokyo Institute of Technology, 2-12-1 Ookayama, Tokyo, 152-8550, Japan;National Institute of Advanced Industrial Science and Technology, 1-1-1 Umezono, Tsukuba, 305-8568, Japan;Tokyo Institute of Technology, 2-12-1 Ookayama, Tokyo, 152-8550, Japan and National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo, 101-8430, Japan

  • Venue:
  • Future Generation Computer Systems
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Existing data grid scheduling systems handle huge data I/O via replica location services coupled with simple staging and decoupled from scheduling of computing tasks. However, when the application/workflow scales, we observe considerable degradations in performance, compared to processing within a tightly-coupled cluster. For example, when numerous nodes access the same set of files simultaneously, extreme performance degradation occurs even if replicas are used, due to bottlenecks that show in the infrastructure. Instead of resorting to expensive solutions such as parallel file systems, we propose tightly coupling replica and data transfer management with computation scheduling for alleviating such situations. In particular, we propose three techniques: (1) data-staging requests aggregation and O(1) replication across multiple nodes using a multireplication framework, (2) replica-centric scheduling, which reuses previously used data for minimizing staging time and (3) overlapped execution of data staging and compute bound tasks. Early benchmark results implemented in our prototype Condor-like grid scheduling system demonstrate that the techniques are quite effective in eliminating much of the overhead in data transfers and achieving 100% of CPU utilization.