Optimisation to the execution performance of grid job based on distributed file system

In grid computing, many applications are invoked by the means of job submission. Grid job submission comprises the following scenarios: file stage-in, execution and file stage-out. Most of the grid midware provides the job submission infrastructure to help to submit jobs, and GridFTP (file downloading) is used in the file stage operations. These scenarios exit mostly in batch mode. It causes computational resources waiting for the data transfer and limits the performance of the grid application, especially when the application is data/communication intensive. Using the file sharing of distributed file system instead of GridFTP in the job submission, the scenarios of grid job submission can be processed in parallel, whereas the waiting of computational resource can be eliminated. By this way, the execution performance of the grid job is promoted. After the comparison of typical distributed file systems, network attached storage that meets the requirements of grid is picked out, and the file sharing mode for the data exchange in grid job is proposed. In the tests of a series of data–communication-intensive jobs, the performance promotion is verified. Comparing with GridFTP, the average promotion with Common Internet File System is 16.8% to single-task jobs and 19.5% to multiple-task jobs.

[1]  Geoffrey Fox,et al.  Special Issue: Workflow in Grid Systems , 2006, Concurr. Comput. Pract. Exp..

[2]  Satoshi Matsuoka,et al.  Access-pattern and bandwidth aware file replication algorithm in a grid environment , 2008, 2008 9th IEEE/ACM International Conference on Grid Computing.

[3]  William E. Allcock,et al.  The Globus Striped GridFTP Framework and Server , 2005, ACM/IEEE SC 2005 Conference (SC'05).

[4]  Mehmet Balman,et al.  A new paradigm: Data-aware scheduling in grid computing , 2009, Future Gener. Comput. Syst..

[5]  David Robinson,et al.  NFS version 4 Protocol , 2000, RFC.

[6]  Ian T. Foster,et al.  Globus GridFTP: what's new in 2007 , 2007, GridNets '07.

[7]  Ruay-Shiung Chang,et al.  A dynamic weighted data replication strategy in data grids , 2008, 2008 IEEE/ACS International Conference on Computer Systems and Applications.

[8]  Yuhui Deng,et al.  Exploring the performance impact of stripe size on network attached storage systems , 2008, J. Syst. Archit..

[9]  Xiaoyan Hong,et al.  An on-line replication strategy to increase availability in Data Grids , 2008, Future Gener. Comput. Syst..

[10]  Geoffrey C. Fox,et al.  Workflow in Grid Systems , 2004 .

[11]  Scott B. Baden,et al.  Overlapping communication and computation with OpenMP and MPI , 2001, Sci. Program..

[12]  Hideo Saito,et al.  A fast topology inference: a building block for network-aware parallel processing , 2007, HPDC '07.

[13]  Christopher Hertel Implementing CIFS: The Common Internet File System , 2003 .

[14]  Kavitha Ranganathan,et al.  Identifying Dynamic Replication Strategies for a High-Performance Data Grid , 2001, GRID.

[15]  R. Potolea,et al.  A taxonomy for grid applications , 2008, 2008 IEEE International Conference on Automation, Quality and Testing, Robotics.

[16]  Kavitha Ranganathan,et al.  Design and Evaluation of Dynamic Replication Strategies for a High-Performance Data Grid , 2001 .

[17]  Erik Riedel,et al.  The ANSI T10 object-based storage standard and current implementations , 2008, IBM J. Res. Dev..

[18]  Linpeng Huang,et al.  Intelligent File Transfer Protocol for Grid Environment , 2005 .

[19]  Tom Clark Designing Storage Area Networks: A Practical Reference for Implementing Storage Area Networks , 2003 .

[20]  Jem Treadwell,et al.  Open Grid Services Architecture , 2006, Grid-Based Problem Solving Environments.

[21]  C. Hou,et al.  What’s New? , 1991, EcoHealth.

[22]  Ali Aydın Selçuk,et al.  Public Key Infrastructure , 2011, Encyclopedia of Cryptography and Security.