—This paper proposes a new load balancing strategy, called Comet, for fast multi-agent cluster computing. We use a new load index that takes into account the cost of inter-agent communications. Agents with predictable workload are assigned statically to cluster nodes, whereas agents with unpredictable workload are allowed to migrate dynamically between cluster nodes using a creditbased load bal...

Is process migration useful for load balancing? We present experimental results indicating that the answer to this question depends largely on the characteristics of the applied workload. Experiments with our Shiva system, which supports remote execution and process migration, show that only those CPU-bound workloads which were generated using an unrealistic exponential distribution for executi...

Introduction: Nurses who have difficulty balancing their family role and responsibilities because of intense work pressure tend to leave their current jobs to work in organizations which offer better working conditions, lower workloads, and more managerial support. Objective: This study aimed to determine nurses’ work-family conflict (WFC), job satisfacti...

The workload on a cluster system can be highly variable, increasing the difficulty of balancing the load across its nodes. The general rule is that high variability leads to wrong load balancing decisions taken with out-of-date information and difficult to correct in real-time during applications execution. In this work the workload variability is studied from the perspective of the load balanc...

This paper studies the problem of scheduling jobs on identical parallel processors to minimize workload balancing criteria. While workload balancing is certainly an important criterion given the need of production systems to use all of their resources efficiently, there is no established measure of performance in the scheduling literature that characterizes total workload balance. In this paper...

The parallel and distributed systems represent one of the important solutions proposed to ameliorate the performance of the sequential association rule mining algorithms. However, parallelization and distribution process is not trivial and still facing many problems of synchronization, communication, and workload balancing. Our study is limited to the workload balancing problem. In this paper, ...

GPU-based clusters are an attractive option for parallel volume rendering. One of the key issues in parallel volume rendering is load balancing, keeping a balanced workload per node is essential for improving performance. A good number of dynamic load balancing schemes have been proposed throughout the years. However, most of these approaches require runtime dynamic data movement or data duplic...

Computational grids have the potential computing power for solving large-scale scientific computing applications. To improve the global throughput of these applications, workload has to be evenly distributed among the available computational resources in the grid environment. This paper addresses the problem of scheduling and load balancing in heterogeneous computational grids. We proposed a tw...

Dynamic load balancing in multicomputers can improve the utilization of processors and the eeciency of parallel computations through migrating workload across processors at runtime. We present a survey and critique of dynamic load balancing strategies that are iterative: workload migration is carried out through transferring processes across nearest neighbor processors. Iterative strategies hav...

Distributed key/value stores are a basic building block for large-scale Internet services. Support for range queries introduces new challenges to load balancing since both the key and workload distribution can be non-uniform. We build on previous work based on the power of choice to present algorithms suitable for active and passive load balancing that adapt to both the key and workload distrib...