A framework for reliable and efficient data placement in distributed computing systems

  • Authors:

  • Tevfik Kosar;Miron Livny

  • Affiliations:

  • Computer Sciences Department, University of Wisconsin-Madison 1210 West Dayton Street, Madison WI 53706, USA;Computer Sciences Department, University of Wisconsin-Madison 1210 West Dayton Street, Madison WI 53706, USA

  • Venue:
  • Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part I
  • Year:
  • 2005

Quantified Score

Hi-index 0.03

Visualization

Abstract

Data placement is an essential part of today's distributed applications since moving the data close to the application has many benefits. The increasing data requirements of both scientific and commercial applications, and collaborative access to these data make it even more important. In the current approach, data placement is regarded as a side affect of computation. Our goal is to make data placement a first class citizen in distributed computing systems just like the computational jobs. They will be queued, scheduled, monitored, managed, and even checkpointed. Since data placement jobs have different characteristics than computational jobs, they cannot be treated in the exact same way as computational jobs. For this purpose, we are proposing a framework which can be considered as a ''data placement subsystem'' for distributed computing systems, similar to the I/O subsystem in operating systems. This framework includes a specialized scheduler for data placement, a high level planner aware of data placement jobs, a resource broker/policy enforcer and some optimization tools. Our system can perform reliable and efficient data placement, it can recover from all kinds of failures without any human intervention, and it can dynamically adapt to the environment at the execution time.