Stork: making data placement a first class citizen in the grid

Todays scientific applications have huge data requirements which continue to increase drastically every year. These data are generally accessed by many users from all across the the globe. This implies a major necessity to move huge amounts of data around wide area networks to complete the computation cycle, which brings with it the problem of efficient and reliable data placement. The current approach to solve this problem of data placement is either doing it manually, or employing simple scripts which do not have any automation or fault tolerance capabilities. Our goal is to make data placement activities first class citizens in the Grid just like the computational jobs. They will be queued, scheduled, monitored, managed, and even check-pointed. More importantly, it will be made sure that they complete successfully and without any human interaction. We also believe that data placement jobs should be treated differently from computational jobs, since they may have different semantics and different characteristics. For this purpose, we have developed Stork, a scheduler for data placement activities in the grid.

[1]  Arie Shoshani,et al.  Storage resource managers: Middleware components for gridstorage , 2005 .

[2]  Miron Livny,et al.  DiskRouter: A Flexible Infrastructure for High Performance Large Scale Data Transfers , 2003 .

[3]  Jon Postel,et al.  File Transfer Protocol specification , 1980, RFC.

[4]  Caltech,et al.  The Palomar Digital Sky Survey (DPOSS) , 1998, astro-ph/9809187.

[5]  Ian T. Foster,et al.  The Anatomy of the Grid: Enabling Scalable Virtual Organizations , 2001, Int. J. High Perform. Comput. Appl..

[6]  Douglas Thain,et al.  The Ethernet approach to grid computing , 2003, High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on.

[7]  Mark C. Butler,et al.  Mass Storage at NCSA: SGI DMF and HP UniTree , 1998 .

[8]  Rajesh Raman,et al.  Matchmaking: distributed resource management for high throughput computing , 1998, Proceedings. The Seventh International Symposium on High Performance Distributed Computing (Cat. No.98TB100244).

[9]  K. L. Kliewer The high performance storage system (HPSS) , 1995 .

[10]  Ian Bird,et al.  Building the Mass Storage System at Jefferson Lab Ian Bird, Bryan Hess, Andy Kowalski , 2001, 2001 Eighteenth IEEE Symposium on Mass Storage Systems and Technologies.

[11]  Ian T. Foster,et al.  Secure, Efficient Data Transport and Replica Management for High-Performance Data-Intensive Computing , 2001, 2001 Eighteenth IEEE Symposium on Mass Storage Systems and Technologies.

[12]  Ian T. Foster,et al.  Condor-G: A Computation Management Agent for Multi-Institutional Grids , 2004, Cluster Computing.

[13]  Miron Livny,et al.  Condor-a hunter of idle workstations , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

[14]  Douglas Thain,et al.  The Kangaroo approach to data movement on the Grid , 2001, Proceedings 10th IEEE International Symposium on High Performance Distributed Computing.