P2P Grids could solve large-scale scientific problems by using geographically distributed heterogeneous resources. However, a number of major technical obstacles must be overcome before this potential can be realized. One critical problem to improve the effective utilization of P2P Grids is the efficient load balancing. This chapter addresses the above-mentioned problem by using a distributed l...

In present days cloud computing is one of the greatest platform which provides storage of data in very lower cost and available for all time over the internet.But it has more critical issue like security, load management and fault tolerance. In this paper we are discussing Load Balancing approach. Many types of load concern with cloud like memory load, CPU load and network load. Load balancing ...

Based on ServiceBSP model, a hierarchical resource load balancing algorithm with Multi-Agent is put forward in this paper which achieves the goal of dynamic load balancing and favorable Fault-tolerant. The algorithm calculates the load value according to the attributes of resource and scheduling tasks relies on the load value, while updating the load information dynamically depending on Multi-A...

A technique for workload balancing on distributed visualization clusters is suggested. The round-robin scheduling of partial object geometry “chunks” avoids render node starvation and balances the data backlog in the send buffers of the geometry nodes. Because frame synchronization requires that all send buffers drain, balancing these send buffer backlogs is seen to substantially improve frame ...

In this paper we present a flexible load balancing service for CORBA-based applications. It offers several static and dynamic strategies for load balancing. The extensive adaptability and flexibility enable usage of the service in a wide variety of problem domains. Analogies to CORBA’s Trading Service have the benefit that developers that have worked with this service are soon familiar with our...

A graph partitioning-based heuristic load-balancing algorithm known as the Largest Task First with Minimum Finish Time and Available Communication Costs is modified to take into account the dynamic nature and heterogeneity of current large-scale distributed computing environments, like Grids. The modified algorithm is applied to facilitate load balancing of a known CFD code used to model crysta...