In the current internet scenario more virtual servers and mirror servers are utilized to maintain load balance of the heterogeneous peer to peer networks. One of the most current existing works developed a state balancing system based on probability distribution of peer abilities, loads of virtual servers, and incomplete data of global peers. On the other hand state balancing method recognizing...

The feature of load sharing or load balancing involves migration of running processes from highly loaded workstations of a network to the lightly-loaded or idle workstations of the network. This paper describes load balancing techniques to share the workload of the workstations belonging to a particular network to gain better performance from the overall network. The mechanisms of load informat...

Load balancing is the process of improving the performance of a parallel and distributed system through a redistribution of load among the processors [1] [5]. In this paper we present the performance analysis of various load balancing algorithms based on different parameters, considering two typical load balancing approaches static and dynamic. The analysis indicates that static and dynamic bot...

In this paper we present a new parallelization of an efficient best-first branch-and-bound algorithm to solve the constrained two-dimensional single stock guillotine cutting stock problem (CSP) to optimality. The underlying sequential branch-and-bound algorithm is based on an exact version of Wang's heuristic suggested by Viswanathan and Bagchi. In our algorithm we improve the upper bound and i...

Workload and resource management are essential functionalities in the software infrastructure for grid computing. The management and scheduling of dynamic grid resources in a scalable way requires new technologies to implement a next generation intelligent grid environment. This work demonstrates that AI technologies can be utilised to achieve effective workload and resource management. A combi...

Load balancing is a crucial issue in parallel and distributed systems to ensure fast processing and optimum utilization of computing resources. Load balancing strategies try to ensure that every processor in the system does almost the same amount of work at any point of time. This paper investigates dynamic loadbalancing algorithm for heterogeneous distributed systems where half of the processo...

This work was supported in part by MURST. Abstract This paper provides a comparative performance evaluation of various load balancing schemes in cellular packet networks. With respect to circuit switched networks, wireless packet technology adds the further issue of Quality of Service of accepted connections. In fact, with packet technology, transmission error performance does not uniquely depe...

10 technique enables a simple cost-eeective implementation with little eeort. It was used for the rst time to implement a fast optimal parallel hashing algorithm 7]. The hashing algorithm in 7] comprises two parts: the rst part is a randomized geometric decaying algorithm which runs for O(lg lg n) steps. By using the technique of this paper and the O(lg lg n) time load balancing of 6], this par...

Real-time visualization is an important tool for immediately inspecting results for scientific simulations. Graphics Processing Units (GPUs) as commodity computing devices offer massive parallelism that can greatly improve performance for data-parallel applications. However, a single GPU provides limited support which is only suitable for smaller scale simulations. Multi-GPU computing, on the o...