Wireless sensor networks are the networks that have small network sensor nodes. They are used now days in order to monitor borders, pressure, temperature, weather forecasting. These sensor nodes need rechargeable batt...
详细信息
ISBN:
(纸本)9781509036691
Wireless sensor networks are the networks that have small network sensor nodes. They are used now days in order to monitor borders, pressure, temperature, weather forecasting. These sensor nodes need rechargeable battery for the power supply. The main disadvantage of these networks is that they have limited power supply. As these sensor nodes are used at borders where battery backup are limited, due to which energy is consumed. So to optimize energy clustering is used in wireless sensor networks to increase the network lifetime of sensor nodes. In this paper our main concentration is on grid clustering for the energy optimization of sensor nodes. In this grids are further divided into small grids in order to reduce the energy consumption. Size of grid is directly related to the transmission range of the nodes. So as the size decreases the transmission range also decreases, this in turn conserves the energy.
Desktop grids use opportunistic sharing to exploit large collections of personal computers and workstations across the Internet, achieving tremendous computing power at low cost. Traditional desktop grid systems are t...
详细信息
ISBN:
(纸本)9781424403431
Desktop grids use opportunistic sharing to exploit large collections of personal computers and workstations across the Internet, achieving tremendous computing power at low cost. Traditional desktop grid systems are typically based on a client-server architecture, which has inherent shortcomings with respect to robustness, reliability and scalability. In this paper, we propose a decentralized, robust, highly available, and scalable infrastructure to match incoming jobs to available resources. Through a comparative analysis on the experimental results obtained via simulation of three different types of matchmaking algorithms under different workload scenarios, we show the trade-offs between efficient matchmaking and good load balancing in a fully decentralized, heterogeneous computational environment.
Despite the recent advances in access control approaches applicable to gridcomputing, there remain issues that impede the development of effective access control for grid applications. Amongst them are the lack of co...
详细信息
ISBN:
(纸本)0769524052
Despite the recent advances in access control approaches applicable to gridcomputing, there remain issues that impede the development of effective access control for grid applications. Amongst them are the lack of context-based models for access control, and reliance on identity or capability-based access control schemes. In this paper, we propose RCBAC model which extends the RBAC with context constraints. The RCBAC mechanisms dynamically grant and adapt permissions to users based on a set of contextual information collected from the grid environments, while retaining the advantages of RBAC model.
A data distribution strategy using time based weighted distributed hash tables is proposed here. Distance function which is based on weighted distributed hash tables, takes the data distribution time between data node...
详细信息
ISBN:
(纸本)9780769534497
A data distribution strategy using time based weighted distributed hash tables is proposed here. Distance function which is based on weighted distributed hash tables, takes the data distribution time between data node and the storage node, the bandwidth of storage nodes, and the physical distance between the data node and the storage node into consideration. From the simulation results, it is concluded that such multi-parameters selection related to the network ensured the data could be fairly distributed to the storage nodes.
To solve a time-consuming problem using spare computing power of many PCs in homes and offices through the Internet is called desktop gridcomputing. The spare computing power varies over time because the original use...
详细信息
ISBN:
(纸本)1932415610
To solve a time-consuming problem using spare computing power of many PCs in homes and offices through the Internet is called desktop gridcomputing. The spare computing power varies over time because the original users utilize their computers for their own purpose. In this paper, we focus on dynamic task scheduling of a parameter sweep application for desktop gridcomputing. For this problem, several existing algorithms with performance prediction are known. However they are merely heuristic. In contrast, recently we proposed an approximation algorithm, called RR, for the problem. RR has the property that the spare computing power consumed by a schedule generated by RR is almost optimal if the number of tasks is enough large. Also, RR does not use any prediction information on the underlying resources. This paper experimentally evaluates RR and other two related algorithms with consideration to precision of prediction about the spare computing power.
In the last few decades we have witnessed the emergence of gridcomputing as an innovative extension to distributedcomputing technology, for computing resource sharing among participants in a virtualized collection o...
详细信息
ISBN:
(纸本)9783642274428
In the last few decades we have witnessed the emergence of gridcomputing as an innovative extension to distributedcomputing technology, for computing resource sharing among participants in a virtualized collection of organizations. gridcomputing entails new challenges as the adaptation of heterogeneous resources unlike homogeneous resources cluster in distributed systems. It is important to maintain proportional fairness in the grid scheduling in order to achieve balanced scheduling. In this paper we propose the importance of genetic algorithm to design schedulers that minimizes the waiting time and maximizes the resource utilization and provides fairness in the grid environment. The resource types and their efficiency are considered in order to maximize their utilization. This paper proposes a solution to maximize the throughput while considering multiple job requests during the scheduling process. The idea of fault tolerance in the crash fault environment will also be implemented based on precautionary method and real time restoration.
Discovery of large amounts of idle CPUs in fully distributed and shared grid systems is needed in relevant applications and is still a challenging problem. In this paper we present a fast, scalable and efficient disco...
详细信息
ISBN:
(纸本)9781424403431
Discovery of large amounts of idle CPUs in fully distributed and shared grid systems is needed in relevant applications and is still a challenging problem. In this paper we present a fast, scalable and efficient discovery protocol founded on a tree-based peer-to-peer (p2p) network with fault-tolerant capabilities and locality features. Each system node stores a good estimation of the number of CPUs that are available in its branch. Each node notifies its father about changes in this value only when it is meaningful enough. This allows low overhead and a stable behavior with concurrent and dynamic allocation of CPUs. This basic mechanism allows any node to launch a discovery process, that needs only to follow the information of free CPUs in each branch. Results from experiments and simulation tests, using a simple allocation method, show discovery time scaling logarithmically with the number of nodes.
In distributed systems it is often necessary to provide coordination among the multiple concurrent processes. Quorum systems provide a decentralized approach to provide such coordination that is resilient to node and ...
详细信息
ISBN:
(纸本)0769510779
In distributed systems it is often necessary to provide coordination among the multiple concurrent processes. Quorum systems provide a decentralized approach to provide such coordination that is resilient to node and communication link failures. Quorum systems are highly available and may be used to balance the load among the elements of the system. In this paper;we propose a modification to the hierarchical grid quorum system that leads to a smaller quorum size, better availability and load. We also propose a nerv hierarchical quorum construction based on the organization of elements in a triangular shape that presents better average quorum size, availability, and load than other highly-available systems with almost optimal load.
Workload information management and resource management are two key aspects in gridcomputing to provide the better services to grid environment users. gridcomputing also faced other challenging areas like heterogene...
详细信息
ISBN:
(纸本)9781467368094
Workload information management and resource management are two key aspects in gridcomputing to provide the better services to grid environment users. gridcomputing also faced other challenging areas like heterogeneous nature of resources, huge number of computing elements, independency of computing resources, different processing capacities of the nodes, different types of load conditions, overloading of jobs at computing nodes, underutilized of resources, etc. A distributed load balancing algorithm is proposed that can handle any kind of grid structure. The proposed algorithm is divided into two steps: To reduce the time taken for executing the jobs or we can say reduce the response time and communication cost between transferring the jobs from one computing node to another in a grid architecture. In proposed algorithm it is shown that the load will be primarily balanced at local level to reduce the communication cost.
Scheduling on a computational grid is an NP Hard problem encouraging a number of scheduling strategies using various parameters and objectives. A computational grid provides the user a platform to execute the compute ...
详细信息
ISBN:
(纸本)9781479925711
Scheduling on a computational grid is an NP Hard problem encouraging a number of scheduling strategies using various parameters and objectives. A computational grid provides the user a platform to execute the compute intensive jobs which otherwise cannot be executed at the user's end. A grid system can be used to its full potential if the scheduling strategy provides the efficient mapping between the software parallelisms available in the application on the hardware parallelism offered by the grid. This work proposes a scheduling strategy that schedules the job on the suitable grid resources as per the job's requirements while considering the communication requirements and preserving the precedence constraints within the job. Simulation study reveals the effectiveness of the model under various conditions.
暂无评论