We present an analysis of the costs and benefits of load sharing of parallel jobs in the computational grid. We begin with a workload generation model that captures the essential properties of parallel jobs and use it as input to a grid simulation model. Our experiments are performed for both

Performance of distributed systems can be improved by load sharing (i.e., distributing load from heavily loaded nodes to lightly loaded ones). Dynamic load sharing policies take system state into account in making job distribution decisions. The state information can be maintained in one of two

Load sharing can improve performance in distributed systems by transferring work from heavily loaded nodes to lightly loaded nodes. We propose a filter component to be included in a load sharing algorithm to detect short-lived jobs not worth considering for remote execution. One filter, called

qstat-u [User] : Show status of user’s jobs qstat: Show status of all jobs qstat-Hf [JobId] : Show historical job information qrls [JobId] : Resumes a suspended job qdel [JobId] : Deletes a job qstat-a: Show status of all jobs (alternate format) qstat-Q: Displays information about queues bsub < script bjobs bjobs-u all bhist-l [JobId] bresume [JobId] bkill [JobId] bstat bqueues

is necessary to support high request rates to popular Web sites. A clustered Web-server organization is preferable to multiple independent mirrored-servers because it maintains a single interface to the users and has the potential to be more scalable, fault-tolerant and better load balanced

Abstract- This research solves the problem of maximizing reliability of heterogeneous distributed computing system where random node can fail permanently. The reliability of the system can be achieved by executing all the tasks queued on its node before they all fail. As the mobile network is defined as a dense collection of mobile entities connected by a wireless link, without any administration or fixed support. In the mobile network no central authority is present due to which the network disconnection is very frequent between the mobile nodes[1]. A chance of errors in the mobile distributed network is very high. Although battery capacities keep increasing, the execution demands of modern mobile devices continue to outstrip their battery lives. As a result, battery life is bound to remain a key factor in the design of mobile applications. In this paper we focused to improve the fault tolerance of the mobile distributed system so that it will take less time and energy consumption for execution when a node fails as compared to other systems.

We apply some of the existing web server redundancy techniques for high service availability and scalability to the relatively new IP telephony context. The paper compares various failover and load sharing methods for registration and call routing servers based on the Session Initiation Protocol

Adaptive algorithms for load-sharing usually comprise two basic functions: state information dissemination and decision making (control). This paper describes a flexible load-sharing algorithm, FLS, which includes a third function introduced for scalability purposes, that of partitioning

of these issues on a wider scale, it has also become imperative to ensure adequate service provision at local level. Load sharing in clusters can contribute to the provision of a high quality service, by exploiting both static and dynamic information. This paper is concerned with the presentation of a load

For maximum efficiency in a multiprocessor system the load should be shared evenly over all processors, that is, there should be no idle processors when tasks are available. The delay in a load sharing algorithm is the larger of the maximum time that any processor can be idle before a task