TITLE

IMPROVEMENT OF JOB SCHEDULING AND TOW LEVEL DATA REPLICATION STRATEGIES IN DATA GRID

AUTHOR(S)
Jolfaei, Fatemeh; Haghighat, Abolfazl T.
PUB. DATE
June 2012
SOURCE
International Journal of Mobile Network Communications & Telemat;Jun2012, Vol. 2 Issue 3, p21
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
With the development of grid computing, Data Grid, as an important branch of Grid Computing focuses on supporting an efficient management mechanism for controlled sharing and large amounts of distributed data. Data intensive jobs are one major kind of jobs in Data Grid, and their scheduling strategies are regarded as one of the most important research fields. Dynamic replication in data grid aims to reduce data access time and to utilize network and storage resources efficiently. This paper proposes a novel dynamic replication strategy, called ERS(Enhancement of Replication Strategy), which reduces data access time by avoiding network congestions in a data grid network and we develop a job scheduling policy, called ESS (Enhancement of Scheduling strategy).
ACCESSION #
83007735

 

Related Articles

  • Adaptive QOS Guided Ant Algorithm for Data Intensive Grid Scheduling. Aranganathan, S.; Mehata, K. M. // European Journal of Scientific Research;8/17/2011, Vol. 58 Issue 1, p133 

    Grid computing is rapidly growing in the distributed heterogeneous environment for utilizing and sharing large scale resources to solve complex scientific problems. Scheduling is the most critical task to achieve high performance in both computation and data grids. To utilize the grid...

  • Modelling and solving grid resource allocation problem with network resources for workflow applications. Mika, Marek; Waligóra, Grzegorz; Węglarz, Jan // Journal of Scheduling;Jun2011, Vol. 14 Issue 3, p291 

    problem of allocating resources of a grid to workflow applications is considered. The problem consists, generally, in allocating distributed grid resources to tasks of a workflow in such a way that the resource demands of each task are satisfied. Grid resources are divided into computational...

  • CFS: A New Dynamic Replication Strategy for Data Grids. Hanandeh, Feras; Khazaaleh, Mutaz; Ibrahim, Hamidah; Latip, Rohaya // International Arab Journal of Information Technology (IAJIT);Jan2012, Vol. 9 Issue 1, p94 

    Data grids are currently proposed solutions to large scale data management problems including efficient file transfer and replication. Large amounts of data and the world-wide distribution of data stores contribute to the complexity of the data management challenge. Recent architecture proposals...

  • Research on Computer Network Data Transfer Methods. Lijun Liu // Advanced Materials Research;2014, Issue 926-930, p2807 

    In order to spread across different locations, sharing of computer resources, and ease of use of idle CPU or storage space Resources, there is the concept of grid and grid computing. Data - intensive scientific and engineering applications ( such as seismic data Numerical Simulation of physics,...

  • A Centralized Location-Based Job Scheduling Algorithm for Inter-Dependent Jobs in Mobile Ad Hoc Computational Grids. Shah, S. C.; Chauhdary, S. H.; Bashir, A. K.; Park, M. S. // Journal of Applied Sciences;2010, Vol. 10 Issue 3, p174 

    This study addresses the problem of job scheduling to inter-dependent jobs in mobile ad hoc computational grids. To maximize the utilization of shared computational resources and to improve application performance, an effective job scheduling algorithm plays a key role. Previously, numerous job...

  • Three Dimensional Matchmaking Model for Optimal Allocation of Resources in Grid. Jacob, Japhynth; Rajsingh, Elijah Blessing; Jesudasan, Isaac Balasingh // European Journal of Scientific Research;12/29/2011, Vol. 67 Issue 1, p128 

    Abstract Grid is a collection of resources owned by multiple organizations that is coordinated to allow them to solve a common problem. Grid has the ability to integrate multiple, distributed, heterogeneous, and independently managed data sources, to provide efficient data transfer mechanisms...

  • Flexible Topology Migration in Optical Cross Add and Drop Multiplexer in Metropolitan Ring Network. Ab-Rahman, Mohammad Syuhaimi // Journal of Computer Science;2012, Vol. 8 Issue 4, p474 

    Problem statement: Optical Cross Add and Drop Multiplexer (OXADM) is a recently invented optical networks device. Approach: A design with a purpose to combine the operational concepts of Optical Add-Drop Multiplexer (OADM) and Optical Cross Connect (OXC) has been developed. It is developed by...

  • INTRODUCTION TO THE SPECIAL ISSUE: PARALLEL, DISTRIBUTED AND NETWORK-BASED COMPUTING: AN APPLICATION PERSPECTIVE. D'Ambra, Pasqua; di Serafino, Daniela; Guarracino, Mario Rosario; Perla, Francesca // Scalable Computing: Practice & Experience;2010, Vol. 11 Issue 3, preceding p1 

    The article discusses various reports published within the issue, including one by Gerassimos Barlas on optimization approach for the reduction of data communication and load imbalance in medical image matching on grids, one by Eugenio Cesario and Domencio Talia on using grids for the...

  • Hybrid Job Scheduling Mechanism Using a Backfill-based Multi-queue Strategy in Distributed Grid Computing. Kiejin Park; Changhoon Kang; Sungsook Kim // International Journal of Computer Science & Network Security;Sep2012, Vol. 12 Issue 9, p39 

    In a distributed computing environment, effective job scheduling is a critical challenge. In this paper, a hybrid job scheduling mechanism is proposed that considers both the meta-scheduling scheme for distributing jobs to overall nodes and the local job scheduling scheme for assigning jobs...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics