gridcomputing uses a job submission model that requires the users to perform a set of interactive operations for executing an application on the grid. grid users are therefore burdened with the tasks of understanding...
详细信息
ISBN:
(纸本)9780769545769
gridcomputing uses a job submission model that requires the users to perform a set of interactive operations for executing an application on the grid. grid users are therefore burdened with the tasks of understanding the basic concept of gridcomputing and the details of job management. Cloud computing, on the other hand, applies a utility model that allows the user to access the underlying platform via Web services. This work brings the Cloud concept to the grid with a result of replacing the job submission model with a service infrastructure. In this case, grid applications are presented as Web services that can be executed on the grid automatically without user interactions. All issues related to job management are performed by the system. The service infrastructure significantly simplifies the users' task in accessing the grid.
gridcomputing is a distributedcomputing paradigm that differs from traditional distributedcomputing in that it is aimed toward large scale systems that even span organizational boundaries. gridcomputing is a partn...
详细信息
ISBN:
(纸本)9780769539256
gridcomputing is a distributedcomputing paradigm that differs from traditional distributedcomputing in that it is aimed toward large scale systems that even span organizational boundaries. gridcomputing is a partnership between clients and servers. grid clients have more responsibilities than do traditional clients and must be equipped with powerful mechanisms for dealing with and recovering from failures, whether they occur in the context of remote execution, work management, or data output. When clients fail to perform the task, the failure should be identified. We propose a novel method to detect an error in the client using voting technique.
Accountability is an important aspect of any computer system. It assures that every action executed in the system can be traced back to some entity. Accountability is even more crucial for assuring the safety and secu...
详细信息
ISBN:
(纸本)9781424444816
Accountability is an important aspect of any computer system. It assures that every action executed in the system can be traced back to some entity. Accountability is even more crucial for assuring the safety and security in grid systems, given the very large number of users active in these sophisticated environments. However, to date no comprehensive approach to accountability for grid systems exists. Our work addresses such inadequacy by developing a comprehensive accountability system driven by policies and supported by accountability agents. In this paper we first discuss the requirements that have driven the design of our accountability system and then present some interesting aspects related to our accountability framework. We describe a fully working implementation of our accountability system, and conduct extensive experimental evaluations. Our experiments, carried out using the Emulab [11] testbed, demonstrate that the implemented system is efficient and it scales for grid systems of large number of resources and users.
Since gridcomputing provides users with more distributedcomputing and storage resources, it gives us an opportunity to design new efficient and robust solvers for the numerical solutions of partial differential equa...
详细信息
ISBN:
(纸本)9781424415595
Since gridcomputing provides users with more distributedcomputing and storage resources, it gives us an opportunity to design new efficient and robust solvers for the numerical solutions of partial differential equations (PDEs). For instance, large scale problems in computational fluid dynamics (CFD) can be efficiently simulated under this environment. However, unfortunately, most of the currently developed PDE solvers using the finite element method (FEM), usually tight combinations of a mesh generator and a linear system solver, are not qualified for the gridcomputing environment. In this paper, based on principles of gridcomputing, we present a grid-enabled Client/Server model for solving the Stokes/(incompressible) Navier-Stokes system in 3D.
gridcomputing infrastructures embody a cost-effective computing paradigm that virtualises heterogeneous system resources to meet the dynamic needs of critical business and scientific applications. These applications ...
详细信息
gridcomputing infrastructures embody a cost-effective computing paradigm that virtualises heterogeneous system resources to meet the dynamic needs of critical business and scientific applications. These applications range from batch processes and long-running tasks to real-time and even transactional applications. gridcomputing environments are inherently dynamic and unpredictable environments sharing services amongst many different users. grid schedulers aim to make the most efficient use of grid resources (high utilisation) while providing the best possible performance to the grid applications (reducing makespan) and satisfying the associated performance and Quality of Service (QoS) constraints. Additionally, in commercial grid settings where economic considerations are an increasingly important part of grid scheduling, it is necessary to minimise the cost of application execution on the behalf of the grid users while ensuring that the applications meet their QoS constraints. Furthermore, efficient resource allocation may allow a resource broker to maximise their profit by minimising the quantity of resource procurement. Scheduling in such a large-scale, dynamic and distributed environment is a complex undertaking. In this paper, we propose an approach to grid scheduling which abstracts over the details of individual applications, focusing instead on the global cost optimisation problem while taking into account the entire workload, dynamically adjusting to the varying service demands. Our model places particular emphasis on the stochastic and unpredictable nature of the grid, leading to a more accurate reflection of the state of the grid and hence more efficient and accurate scheduling decisions. (c) 2007 Elsevier B.V. All rights reserved.
As computer networks rapidly increase in size and speed, Internet-distributed systems such as P2P, volunteer computing, and grid systems are increasingly common. A precise and accurate characterization of Internet res...
详细信息
ISBN:
(纸本)9781424425785
As computer networks rapidly increase in size and speed, Internet-distributed systems such as P2P, volunteer computing, and grid systems are increasingly common. A precise and accurate characterization of Internet resources is important for the design and evaluation, of such Internet-distributed systems, yet our picture of the Internet landscape is not perfectly clear. To improve this picture, we measure and characterize the time dynamics of availability ire a large-scale Internet-distributed system with over 110,000 hosts. Our characterization focuses on identifying patterns of correlated availability. We determine scalable and accurate clustering techniques and distance metrics for automatically detecting significant availability patterns. By means of clustering, we identify groups of resources with correlated availability that exhibit similar time effects. Then, we show how these correlated clusters of resources can be used to improve resource management for parallel applications in the context of volunteer computing.
Wireless microsensor networks usually consist of a large number of small sensor nodes with limited onboard energy supply and deployed densely in a given area for information harvesting purposes. To reduce energy consu...
详细信息
ISBN:
(纸本)9781424444465
Wireless microsensor networks usually consist of a large number of small sensor nodes with limited onboard energy supply and deployed densely in a given area for information harvesting purposes. To reduce energy consumption and prolong network lifetime, clustering techniques are often used, among which the grid-based ones are very popular due to their simplicity and scalability. In this paper, we analyze and evaluate the energy-optimal grid size for a grid-based clustering and routing scheme proposed specifically for wireless microsensor networks. Through numerical and simulation results, we reveal the tradeoff generic to all grid-based clustering schemes. In addition, we propose a randomized technique to further prolong the network lifetime and discuss other energy-saving opportunities. This paper provides some insights into the intrinsic limits of grid-based clustering schemes for wireless microsensor networks.
In a gridcomputing environment, dynamicity, and geographically distributed sites, make task scheduling problems challenging to solve. It is hard for a local site to obtain precise real-time information about other si...
详细信息
ISBN:
(纸本)9780889866386
In a gridcomputing environment, dynamicity, and geographically distributed sites, make task scheduling problems challenging to solve. It is hard for a local site to obtain precise real-time information about other sites given that specific information on a site such as load and computing resources may change rapidly. Moreover, in data grid environment, large scale data intensive applications make scheduling problems even more challenging since both computational and data storage resources must be taken into consideration. In this paper we propose an innovative peer-to-peer scheduler to solve these problems. This scheduler is distributed and scalable. We used simulation to evaluate the performance of the scheduler under different circumstances, such as different number of hops to search suitable sites and different number of incoming tasks. Results show that our scheduler can successfully schedule around 75% of incoming tasks within their deadlines in average. For computation-intensive tasks, it can successfully schedule more than 90% of incoming tasks.
Resources in the computational grid nowadays are usually owned by multiple administrative domains which are connected by WANs. grid resources have their own local management policies and a grid scheduler cannot contro...
详细信息
ISBN:
(纸本)9780889866386
Resources in the computational grid nowadays are usually owned by multiple administrative domains which are connected by WANs. grid resources have their own local management policies and a grid scheduler cannot control resources beyond the domain of itself. Scheduling algorithms designed for traditional systems do not consider these new characteristics in grids. In this paper, a two-phase scheduling approach for DAG-based applications in the grid is proposed. In the first phase, the task graph is partitioned according to the status of selected available resource clusters by an algorithm called GPRC. In the second phase, an algorithm called HEFT is used to map task nodes to processing nodes inside a resource cluster. GPRC does not require detailed status information or control privilege on every grid resource so that the dependence on grid information services is reduced and, at the same time, the higher priority of local resource management policies is respected. Analysis and experiment show the effectiveness and adaptation of this new approach in the grid scenario.
Improvements in computer and networking technologies over the past decades produced new type of collaborative computing environment called Gild Networks. grid is a parallel and distributedcomputing network system tha...
详细信息
ISBN:
(纸本)9781424419678
Improvements in computer and networking technologies over the past decades produced new type of collaborative computing environment called Gild Networks. grid is a parallel and distributedcomputing network system that provides the ability to perform higher throughput computing by taking advantage of many computing resources available in the network. Therefore, to achieve a scalable and reliable grid network system, we need to efficiently distribute the load among the resources accessible on the network. In this paper, we present a distributed and scalable load-balancing framework for Gild Networks. The generated network system is self-organized and depends only on local information for load distribution and resource discovery. Simulation results show that the generated network system provides an effective, scalable, and reliable load-balancing scheme for the distributed resources accessible on grid networks.
暂无评论