16 research outputs found

    Dynamic replication strategies in data grid systems: A survey

    Get PDF
    In data grid systems, data replication aims to increase availability, fault tolerance, load balancing and scalability while reducing bandwidth consumption, and job execution time. Several classification schemes for data replication were proposed in the literature, (i) static vs. dynamic, (ii) centralized vs. decentralized, (iii) push vs. pull, and (iv) objective function based. Dynamic data replication is a form of data replication that is performed with respect to the changing conditions of the grid environment. In this paper, we present a survey of recent dynamic data replication strategies. We study and classify these strategies by taking the target data grid architecture as the sole classifier. We discuss the key points of the studied strategies and provide feature comparison of them according to important metrics. Furthermore, the impact of data grid architecture on dynamic replication performance is investigated in a simulation study. Finally, some important issues and open research problems in the area are pointed out

    2015 ESC Guidelines for the management of patients with ventricular arrhythmias and the prevention of sudden cardiac death the Task Force for the Management of Patients with Ventricular Arrhythmias and the Prevention of Sudden Cardiac Death of the European Society of Cardiology (ESC) Endorsed by: Association for European Paediatric and Congenital Cardiology (AEPC)

    Get PDF
    N/

    Effects of adaptive degrees of trust on coevolution of quantum strategies on scale-free networks

    Get PDF
    We study the impact of adaptive degrees of trust on the evolution of cooperation in the quantum prisoner's dilemma game. In addition to the strategies, links between players are also subject to evolution. Starting with a scale-free interaction network, players adjust trust towards their neighbors based on received payoffs. The latter governs the strategy adoption process, while trust governs the rewiring of links. As soon as the degree of trust towards a neighbor drops to zero, the link is rewired to another randomly chosen player within the network. We find that for small temptations to defect cooperators always dominate, while for intermediate and strong temptations a single quantum strategy is able to outperform all other strategies. In general, reciprocal trust remains within close relationships and favors the dominance of a single strategy. Due to coevolution, the power-law degree distributions transform to Poisson distributions.Qiang Li, Minyou Chen, Matjaz Perc, Azhar Iqbal, & Derek Abbot
    corecore