This research explores the appropriateness of unbalancing the workload per machine in certain types of flexible manufacturing systems (FMSs) configured as pooled machines of unequal sizes. Studies are conducted to examine the applicability of following an objective to unbalance workloads when solving the FMS planning problems of selecting part types to be machined together and determining their...

A number of technology and workload trends motivate us to consider a new request distribution and load balancing strategy for streaming media clusters. First, in emerging media workloads, a significant portion of the content is short and encoded at low bit rates. Additionally, media workloads display a strong temporal and spatial locality. This makes modern servers with gigabytes of main memory...

The hierarchical combination of decomposition strategies for the development of parallel Particle-in-cell simulation codes, targeted to hierarchical distributed-shared memory architectures, is discussed in this paper, along with its MPI+OpenMP implementation. Particular emphasis is given to the devised dynamic workload balancing technique.

Parallel incremental scheduling is a new approach for load balancing. In parallel scheduling,all processorscooperatetogether to balance the workload. Parallel scheduling accuratelybalances the load by using global load information. In incremental scheduling, the system scheduling activity alternates with the underlying computation work. This paper provides an overview of parallel incremental sc...

We study a dose-driven dynamic load balancing strategy to evaluate database recursive queries. This proposal aims at obtaining a good workload balance with full use of the available resources, with different kinds of skew considered. The strategy is intended for general recursive queries and preliminary computational results illustrate its ef-ciency when applied to the particular case of linear...

This paper deals with the workload balancing problem in identical parallel machines context. It consists of assigning n different jobs to m identical parallel machines as equally as possible. First, we present a critical analysis of classical formulation based on the minimization of the maximum workload or the completion time of the bottleneck machine previously presented in the literature. We ...

In partially replicated distributed database systems, the minimization of total time usually attempts to minimize resource consumption and therefore to maximize the system throughput. On the other hand, the minimization of response time may be obtained by having a large number of parallel executions to different sites, requiring a higher resource consumption, which means that the system through...

Line Integral Convolution (LIC) has proven to be a very powerful visualization technique of vector data sets such as those obtained from numerical simulations. Despite its usefulness, this technique is notoriously computational intensive and is increasingly challenging as the amount of data continuously grows due to the advances in both computer hardware and software technology. Parallel proces...

Cloud computing requires more reliable, efficient and scalable load balancing algorithm to survive. As one of the main challenges in cloud computing, load balancing facilitate dynamic workload across multiple nodes ensuring that no single node get overloaded. With proper load balancing, resource consumption is maintained at minimum level, enabling scalability, avoiding bottleneck and overprovis...

g (EFR) is a form of geographical multirkload-balancing problem. However, it assumes that the -based routing protocols can be subject to various attacks. -based routing protocols. More -Pole Field Persistent Routing -effort, they can be highly destructive to s workload balanced operation. We present extensive