This paper deals with the modelling of a particular class of manufacturing lines, governed by a rule imposing the self-balancing. Bucket brigades were first studied as stochastic dynamic systems. Thus, a sufficient condition for self-balancing was proved. Under some particular conditions, bucket brigades may be regarded as nonlinear dynamic systems. Simulations have shown that their state traje...

Cloud computing offers a variety of dynamic flexible resources to expedite the processing of large scale tasks in pay-by-use manner to public. In that, resource distribution and the effective load balancing among the available resources in heterogeneous environment is a major concern. Load balancing is employed across different data centers in order to establish network availability and to incr...

Efficiently exploiting the resources of data centers is a complex task that requires efficient and reliable load balancing and resource allocation algorithms. The former are in charge of assigning jobs to servers upon their arrival in the system, while the latter are responsible for sharing server resources between their assigned jobs. These algorithms should take account of various constraints...

The Ceph distributed object-based storage system, developed at UC Santa Cruz, [1] uses CRUSH, a pseudo-random placement function, to decide which OSDs to store data on, instead of storing the placement information in a table. This technique offers multiple advantages. In particular, the amount of metadata stored per file is drastically reduced, reducing the load on the metadata servers and spee...

Many adaptive techniques for the solution of both steady and time-dependent PDEs rely on a hierarchy of meshes: starting with a coarse global mesh and reening this by diierent amounts in diierent regions. Since this reenement (or de-reenement) is part of the solution process it is necessary to dynamically alter the way in which the mesh is partitioned if a parallel implementation of such an alg...

This work considers the problem of efficiently performing a set of tasks using a network of processors in the setting where the network is subject to dynamic reconfigurations, including partitions and merges. A key challenge for this setting is the implementation of dynamic load balancing that reduces the number of tasks that are performed redundantly because of the reconfigurations. We explore...

Distributed systems have been an active research area in computer science for the last decade, task allocation and load balancing have been a major issue associated with such systems. The load-balancing problem, attempts to compute the assignment with smallest possible makespan (i.e. the completion time at the maximum loaded computing node). Load balancing problem is a NP hard problem. This pap...

In this paper we develop a Load Balancing scheme for networks based on the MPLS framework. The proposed algorithm (DYLBA Dynamic Load Balancing Algorithm) implements a local search technique where the basic move is the modification of the route for a single Label Switched Path. Experiments under a dynamic traffic scenario show a reduced rejection probability especially with long-lived connectio...