Many distributed software systems allow participation by large numbers of untrusted, potentially faulty components on an open network. As faults are inevitable in this setting, these systems utilize redundancy and rep...
详细信息
ISBN:
(纸本)9780769543642
Many distributed software systems allow participation by large numbers of untrusted, potentially faulty components on an open network. As faults are inevitable in this setting, these systems utilize redundancy and replication to achieve fault tolerance. In this paper, we present a novel "smart" redundancy technique called iterative redundancy, which ensures efficient replication of computation and data given finite processing and storage resources, even when facing Byzantine faults. Iterative redundancy is more efficient and more adaptive than comparable state-of-the-art techniques that operate in environments with unknown system resource reliability. We show how systems that solve computational problems using a network of independent nodes can benefit from iterative redundancy. We present a formal analytical analysis and an empirical analysis, demonstrate iterative redundancy on a real-world volunteer-computing system, and compare it to existing methods.
Resource allocation is one key issue in the computational grid. To this problem, we propose An Economy QOS Resource Allocation Algorithm Based on Agent. This algorithm mainly includes the resource allocation algorithm...
详细信息
ISBN:
(纸本)9789889867140
Resource allocation is one key issue in the computational grid. To this problem, we propose An Economy QOS Resource Allocation Algorithm Based on Agent. This algorithm mainly includes the resource allocation algorithm based on payment ratio and the biding algorithm. We provide simulation experiment result, compared with the related work, shows that the algorithm is effectively and practical in the computational grid environment.
This work presents a P2P based grid scheduling system for highly dynamic and highly heterogeneous environments, such as home networks, where we can find a variety of devices (laptops, PCs, game consoles, etc.) and net...
详细信息
ISBN:
(数字)9783642219375
ISBN:
(纸本)9783642219368
This work presents a P2P based grid scheduling system for highly dynamic and highly heterogeneous environments, such as home networks, where we can find a variety of devices (laptops, PCs, game consoles, etc.) and networks. Our solution is based on the distribution of the matchmaking task among providers, leaving the final allocation decision to a central scheduler that can be running on a limited device without a big loss in performance. We evaluate our solution by simulating different scenarios and configurations against the Opportunistic Load Balance (OLB) scheduling heuristic, which we found to be the best option for home grids from the existing solutions that we analyzed. The results have shown that our solution performs similar to or better than OLB.
The next generation of scientific experiments and studies are being carried out by large collaborations of researchers distributed around the world engaged in analysis of huge collections of data generated by scientif...
详细信息
ISBN:
(纸本)9783037850992
The next generation of scientific experiments and studies are being carried out by large collaborations of researchers distributed around the world engaged in analysis of huge collections of data generated by scientific instruments. grid computing has emerged as an enabler for such collaborations as it aids communities in sharing resource to achieve common objective. This paper defines the problem of scheduling distributed data-intensive application on to Gird resource and presents a formal resource and application model for the problem.
In a traditional computational grid environment, the owners of resources usually provide lamination about then resources extracted by pre-configured information services or web services However, such information is no...
详细信息
In a traditional computational grid environment, the owners of resources usually provide lamination about then resources extracted by pre-configured information services or web services However, such information is not sufficient for the scheduler in the high-performance distributed computing To solve this problem. we propose a scalable grid information service framework. named mar (adaptive Information discoVery framewOrk lot computational grid). By using deadline-constrained flooding collector dissemination and P2P-like information collection schemes. PIVOT provides an active mechanism to collect application-specific resource information In particular. PIVOT provides a resource information service for application-specific schedulers The best-effort performance on overhead traffic and communication latency during information discovery is guaranteed by two new distributed cooperative algorithms The experimental results in the simulations and real computational grid platform demonstrate that PIVOT has a high level of adaptability lot application-specific resource information discovery. and also improves the accuracy of resource allocation and the efficiency of executing parallel tasks in traditional information services (C) 2010 Elsevier Inc. All rights reserved
All existing fault-tolerance job scheduling algorithms for computational grids were proposed under the assumption that all sites apply the same fault-tolerance strategy. They all ignored that each grid site may have i...
详细信息
All existing fault-tolerance job scheduling algorithms for computational grids were proposed under the assumption that all sites apply the same fault-tolerance strategy. They all ignored that each grid site may have its own fault-tolerance strategy because each site is itself an autonomous domain. in fact, it is very common that there are multiple fault-tolerance strategies adopted at the same time in a large-scale computational grid. Various fault-tolerance strategies may have different hardware and software requirements. For instance, if a grid site employs the job checkpointing mechanism, each computation node must have the following ability. Periodically, the computational node transmits the transient state of the job execution to the server. If a job fails, it will migrate to another computational node and resume from the last stored checkpoint. Therefore, in this paper we propose a genetic algorithm for job scheduling to address the heterogeneity of fault-tolerance mechanisms problem in a computational grid. We assume that the system supports four kinds fault-tolerance mechanisms, including the job retry, the job migration without checkpointing, the job migration with checkpointing, and the job replication mechanisms. Because each fault-tolerance mechanism has different requirements for gene encoding, we also propose a new chromosome encoding approach to integrate the four kinds of mechanisms in a chromosome. The risk nature of the grid environment is also taken into account in the algorithm. The risk relationship between jobs and nodes are defined by the security demand and the trust level. Simulation results show that our algorithm has shorter makespan and more excellent efficiencies on improving the job failure rate than the Min-Min and sufferage algorithms. (C) 2009 Elsevier B.V. All rights reserved.
Diversos são os esforços para o desenvolvimento de políticas de escalonamento em grid computacional. O uso de simuladores de grid computacional é de especial importância para o estudo de algor...
详细信息
Diversos são os esforços para o desenvolvimento de políticas de escalonamento em grid computacional. O uso de simuladores de grid computacional é de especial importância para o estudo de algoritmos de escalonamento de tarefas. Através dos simuladores, é possível avaliar e comparar o desempenho de diferentes algoritmos em diferentes cenários. Apesar das ferramentas de simulação fornecerem funcionalidades básicas para simulação de ambientes distribuídos, elas não disponibilizam políticas internas de escalonamento de tarefas; além disso, a implementação dos algoritmos deve ser feita pelo próprio usuário. Portanto, o objetivo deste trabalho é desenvolver a biblioteca de escalonamento de tarefas LIBTS (Library Tasks Scheduling) e adaptá-la ao simulador Simgrid para oferecer aos usuários uma ferramenta que possibilite o estudo de algoritmos de escalonamento de tarefas em grid computacional. Através da LIBTS os usuários podem comparar os algoritmos implementados (Workqueue (WQ), Workqueue with Replication (WQR), Sufferage, XSufferage, Dynamic FPLTF) em diversos cenários, como também desenvolver e implementar novos algoritmos de escalonamento de tarefas. Este trabalho também proporciona uma revisão de literatura sobre grid computacional, apresentando as características e metodologias dos algoritmos implementados na LIBTS e as principais características das ferramentas de simulação. Além disso, os cenários de testes criados para comparar os algoritmos validaram o funcionamento da biblioteca e o funcionamento correto dos algoritmos na LIBTSToo much has been done to develop scheduling policies in computational grid. The use of computational grid simulators is particularly important for studying the algorithms of task scheduling. Through the simulators it’s possible to assess and compare the performance of different algorithms in various scenarios. Despite the simulation tools provide basic features for simulation in distributed environments, they don’t offer internal policies
Access control in a grid environment is a challenging issue because the heterogeneous nature and independent administration of geographically dispersed resources in grid require access control to use fine-grained poli...
详细信息
Access control in a grid environment is a challenging issue because the heterogeneous nature and independent administration of geographically dispersed resources in grid require access control to use fine-grained policies. We established a task-and-role-based access-control model for computational grid (CG-TRBAC model), integrating the concepts of role-based access control (RBAC) and task-based access control (TBAC). In this model, condition restrictions are defined and concepts specifically tailored to Workflow Management System are simplified or omitted so that role assignment and security administration fit computational grid better than traditional models; permissions are mutable with the task status and system variables, and can be dynamically controlled. The CG-TRBAC model is proved flexible and extendible. It can implement different control policies. It embodies the security principle of least privilege and executes active dynamic authorization. A task attribute can be extended to satisfy different requirements in a real grid system.
In the recent years an increasing number of computational grids have been built, providing an unprecedented amount of computational power. Based on their inherent parallelism, Evolutionary Algorithms are well suited f...
详细信息
ISBN:
(纸本)9783642164927
In the recent years an increasing number of computational grids have been built, providing an unprecedented amount of computational power. Based on their inherent parallelism, Evolutionary Algorithms are well suited for distributed execution in such grids. Unfortunately, there are several challenges concerning the usage of a grid infrastructure (e.g. the synchronization and submission of jobs and file transfer tasks). In this paper we present a new framework which makes a Globus based grid easily accessible for Evolutionary Algorithms and takes care of the parallelization. The usability is demonstrated by the example of an Evolutionary Algorithm for the Traveling Salesman Problem.
The next generation of scientific experiments and studies are being carried out by large collaborations of researchers distributed around the world engaged in analysis of huge collections of data generated by scientif...
详细信息
The next generation of scientific experiments and studies are being carried out by large collaborations of researchers distributed around the world engaged in analysis of huge collections of data generated by scientific *** computing has emerged as an enabler for such collaborations as it aids communities in sharing resource to achieve common *** paper defines the problem of scheduling distributed data-intensive application on to Gird resource and presents a formal resource and application model for the problem.
暂无评论