Load balancing allows to increase system throughput and to reduce application response time. However, when the computing system increases in scale, load balancing becomes very complex to manage and is time consuming. Moreover, actual load balancing mechanisms are not able to manage heterogeneity both in system architectures and application behaviors. To deal with such systems we propose to spli...

Load balancing is the process of redistributing the work load among nodes of the distributed system to improve both resource utilization and job response time while also avoiding a situation where some nodes are heavily loaded while others are idle or doing little work. A dynamic load balancing algorithm assumes no a priori knowledge about job behavior or the global state of the system, i.e., l...

In ubiquitous networks, a lot of sensors and RFID readers will be connected to the networks as well as PCs and mobile phones are connected, and huge numbers of transactions are expected to be issued by these devices. Since the loads caused by the transactions are getting increased gradually, it is difficult for system manager to estimate the required performance. The scalable load balancing met...

This paper concerns with the balancing theory for the system governed by diffusion partial differential equation, which is refereed here as infinite dimensional system or distributed-parameter system. Based on the eigenvalue-eigenfunction structure of Laplacian differential operator, the approximate controllability and initial observability are constructed. In order to perform the balanced real...

Abstmcl-The implementation of a load balancing policy on a continuous basis in a delay-limited distributed computing environment may not only drain the computational resources of each computational element (CE), hut can also lead to an unnecessary exchange of loads between the CEs. This degrades the system performance, measured by the overall completion time of the total tasks in the system. Th...

The implementation of a load balancing policy on a continuous basis in a delay-limited distributed computing environment may not only drain the computational resources of each computational element (CE), but can also lead to an unnecessary exchange of loads between the CEs. This degrades the system performance, measured by the overall completion time of the total tasks in the system. Thus, for ...

In this paper we compare various preconditioners for the numerical solution of partial differential equations. We compare the well-known balancing preconditioner used in domain decomposition methods with a so-called deflation preconditioner. We prove that the effective condition number of the deflated preconditioned system is always, i.e., for all deflation vectors and all restrictions and prol...

In this paper we study the balancing and model-reduction of linear systems with discrete jumps at periodic time instants. These systems arise in the study of linear systems with sampled data control and filtering problems. We study the balancing for the case of fixed and infinite intervals. We show that the system balancing can be used to obtain a reduced order-model of the system with the prop...

In distributed-computing environments with high communication delays and cost, limiting the number of balancing instants in scheduling algorithms results in an improved performance compared to the case where load balancing is executed continuously. Therefore, finding the optimal number of balancing instants and optimizing the performance over the inter-balancing time and loadbalancing gain beco...