{'fraction_non_alphanumeric': 0.011611030478955007, 'fraction_numerical': 0.0, 'mean_word_length': 5.3842592592592595, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Hybrid Negotiation Mechanism for Resolution Conflicts between Replicas in Data Grid

Large scale systems such as computational grid are distributed computing infrastructure that can provide globally available network resources. Grid computing has emerged as a framework for supporting complex compilations over large data sets. In general, grids enable the efficient sharing and management of computing resources for the purpose of performing large complex tasks. In particular, grids have been defined as anything from batch schedulers to peer-to-peer platforms. To be able to sharing data, it is recommended to use the replication technique, it makes data accessible by user who is kept transparent to node and network crashes and communication failure since the user data is redundantly available on more than one site. The replication management and their implementation is not a simple task and produces many additional problems, like replicas consistency problem. One of the concerns major in the consistency management approaches called optimistic, it is the conflicts resolution between replicas. In this paper we present an hybrid negotiation mechanism based on the various negotiation forms between virtual consistency agents to be able to critical situation for sites and to reduce the number of conflicts between replicas to converge them more quickly in data grids.