earticle

논문검색

Oriented Consistency Algorithms for Virtual Organizations in Intensive Data Grids

초록

영어

Replication can improve the reliability of a Computational Grid. Replication allows a resource to be used even if some of the in-stances are not running or are inaccessible. However the challenge is how maintain consistent the replicas. In this paper we propose and eval-uate "Oriented Consistency" (OC), a weak consistency algorithm for the dissemination of changes considering application-level in computer
Grids. The main aim of this algorithm is optimizing the propagation of changes introducing a preference for nodes in Virtual Organizations of the Grid. The algorithm has been simulated over ns-2, and evaluated with several simple and complex spatial distributions of the users. The impulse response of the algorithm has been characterized. We conclude that considering application parameters such as clustered users of Vir-tual Organizations in the event or change propagation mechanism gives a surprising improvement in the speed of change propagation perceived by most users. In other words, it satis¯es the greatest number of users in the shortest amount of time.

목차

Abstract.
 1 Introduction
 2 System model
 3 The oriented consistency algorithm
  3.1 The OC algorithm
 4 Simulation methodology
  4.1 Demand Workload
  4.2 Performance Metric
 5 Simulation results
 6 Conclusions
 References

저자정보

  • Jesus Acosta-Elias Facultad de Ciencias, Universidad Autonoma de San Luis Potosi
  • Enrique Stevens-Navarro Facultad de Ciencias, Universidad Autonoma de San Luis Potosi
  • Ulises Pineda-Rico The University of Manchester, School of Electrical and Electronic Engineering

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.