HGASA: An Efficient Hybrid Technique for Optimizing Data Access in Dynamic Data Grid

2015 ◽  
pp. 132-136 ◽  
Author(s):  
R. Kingsy Grace ◽  
R. Manimegalai
Keyword(s):  
Data Access ◽  
Data Grid ◽  
Hybrid Technique ◽  
Dynamic Data

Study of Scheduling Strategies in a Dynamic Data Grid Environment

2004 ◽  
pp. 88-94 ◽  
Author(s):  
R. A. Dheepak ◽  
Shakeb Ali ◽  
Shubhashis Sengupta ◽  
Anirban Chakrabarti
Keyword(s):  
Data Grid ◽  
Grid Environment ◽  
Dynamic Data ◽  
Scheduling Strategies

Policy Driven Negotiation to Improve the QoS in Data Grid

2010 ◽  
pp. 1041-1056
Author(s):  
Ghalem Belalem
Keyword(s):  
Large Scale ◽  
Data Access ◽  
Data Grid ◽  
Management Service ◽  
Replica Placement ◽  
Data Grids ◽  
Large Scale Systems ◽  
Consistency Management ◽  
Access Latency ◽  
Replicated Data

Data grids have become an interesting and popular domain in grid community (Foster and Kesselmann, 2004). Generally, the grids are proposed as solutions for large scale systems, where data replication is a well-known technique used to reduce access latency and bandwidth, and increase availability. In splitting of the advantages of replication, there are many problems that should be solved such as, • The replica placement that determines the optimal locations of replicated data in order to reduce the storage cost and data access (Xu et al, 2002); • The problem of determining which replica will be accessed to in terms of consistency when we need to execute a read or write operation (Ranganathan and Foster, 2001); • The problem of degree of replication which consists in finding a minimal number of replicas without reducing the performance of user applications; • The problem of replica consistency that concerns the consistency of a set of replicated data. This consistency provides a completely coherent view of all the replicas for a user (Gray et al 1996). Our principal aim, in this article, is to integrate into consistency management service, an approach based on an economic model for resolving conflicts detected in the data grid.

An Architectural Overview of the GRelC Data Access Service

2009 ◽  
pp. 98-108 ◽  
Author(s):  
Sandro Fiore ◽  
Alessandro Negro ◽  
Salvatore Vadacca ◽  
Massimo Cafaro ◽  
Giovanni Aloisio ◽  
...  
Keyword(s):  
Data Access ◽  
Data Grid ◽  
Distributed Data ◽  
Distributed Environment ◽  
Database Access ◽  
Grid Environments ◽  
Grid Database ◽  
Access Service ◽  
Real Challenge ◽  
Grid Storage

Grid computing is an emerging and enabling technology allowing organizations to easily share, integrate and manage resources in a distributed environment. Computational Grid allows running millions of jobs in parallel, but the huge amount of generated data has caused another interesting problem: the management (classification, storage, discovery etc.) of distributed data, i.e., a Data Grid specific issue. In the last decade, many efforts concerning the management of data (grid-storage services, metadata services, grid-database access and integration services etc.) identify data management as a real challenge for the next generation petascale grid environments. This work provides an architectural overview of the GRelC DAS, a grid database access service developed in the context of the GRelC Project and currently used for production/tutorial activities both in gLite and Globus based grid environments.

Replica Placement Strategy for Data Grid Environment

2013 ◽  
Vol 5 (1) ◽  
pp. 70-81 ◽  
Author(s):  
Mohammed K. Madi ◽  
Yuhanis Yusof ◽  
Suhaidi Hassan
Keyword(s):  
Resource Sharing ◽  
Data Access ◽  
Data Grid ◽  
Computational Time ◽  
Replica Placement ◽  
File Transfer ◽  
Large Bandwidth ◽  
Multiple Copies ◽  
Data Files ◽  
Computational Resources

Data Grid is an infrastructure that manages huge amount of data files, and provides intensive computational resources across geographically distributed collaboration. To increase resource availability and to ease resource sharing in such environment, there is a need for replication services. Data replication is one of the methods used to improve the performance of data access in distributed systems by replicating multiple copies of data files in the distributed sites. Replica placement mechanism is the process of identifying where to place copies of replicated data files in a Grid system. Existing work identifies the suitable sites based on number of requests and read cost of the required file. Such approaches consume large bandwidth and increases the computational time. The authors propose a replica placement strategy (RPS) that finds the best locations to store replicas based on four criteria, namely, 1) Read Cost, 2) File Transfer Time, 3) Sites’ Workload, and 4) Replication Sites. OptorSim is used to evaluate the performance of this replica placement strategy. The simulation results show that RPS requires less execution time and consumes less network usage compared to existing approaches of Simple Optimizer and LFU (Least Frequently Used).

Effective Data Storage and Dynamic Data Auditing Scheme for Providing Distributed Services in Federated Cloud

2020 ◽  
Vol 29 (16) ◽  
pp. 2050259
Author(s):  
A. M. Sermakani ◽  
D. Paulraj
Keyword(s):  
Data Storage ◽  
Input Data ◽  
Data Access ◽  
Retrieval Algorithm ◽  
Public Cloud ◽  
Dynamic Data ◽  
Storage And Retrieval ◽  
Cloud Database ◽  
Private And Public ◽  
Data Auditing

Recently, many organizations and industries are using the cloud computing technologies for exchanging the resources and their confidential data. For this purpose, many cloud services are available and also provide the facility to categorize their users as private and public users for accessing their own data from private cloud and public cloud. The combination of these two clouds is called federated cloud which facilitates to allow both kinds of cloud users for accessing their own data on same cloud database. In this scenario, the authorization and authentication process is becoming complex task on cloud. For providing the facility to access their own data only from federated cloud, a new secured data storage and retrieval algorithm called AES and Triple-DES-based Secured Storage and Retrieval Algorithm (ATDSRA) are proposed for storing the private and public cloud user’s data securely on cloud database. Here, the TDES is used for encrypting the input data, data merging and aggregation methods were used for grouping the encrypted input data. Moreover, a new dynamic data auditing scheme called CRT-based Dynamic Data Auditing Algorithm (CRTDDA) is proposed for conducting the cloud data auditing over the federated cloud and also restricting the data access. The proposed new auditing mechanism that is able to protect the stored data from access violence. In addition, the standard Table64 is used for encryption and decryption processes. The experimental results of this work proves the efficiency of the proposed model in terms of security level.

Dynamic Data Grid Replication Algorithm Based on Weight and Cost of Replica

2014 ◽  
Vol 12 (4) ◽  
Author(s):  
Zhongping Zhang ◽  
Chao Zhang ◽  
Mengfei Zuo ◽  
Zhiping Wang
Keyword(s):  
Data Grid ◽  
Dynamic Data

Job scheduling and dynamic data replication in data grid environment

2013 ◽  
Vol 64 (1) ◽  
pp. 204-225 ◽  
Author(s):  
Najme Mansouri ◽  
Gholam Hosein Dastghaibyfard
Keyword(s):  
Job Scheduling ◽  
Data Replication ◽  
Data Grid ◽  
Grid Environment ◽  
Dynamic Data ◽  
Dynamic Data Replication
Sign in / Sign up

Export Citation Format

Share Document