𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Load balancing for group technology planning and control

✍ Scribed by E. Oliva-Lopez; G.F. Purcheck

Publisher
Elsevier Science
Year
1979
Weight
1002 KB
Volume
19
Category
Article
ISSN
0020-7357

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Resource scheduling and load balancing i
Resource scheduling and load balancing in distributed robotic control systems
✍ Colin McMillen; Kristen N. Stubbs; Paul E. Rybski; Sascha A. Stoeter; Maria Gini πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 196 KB

This paper describes the latest advances made to a software architecture designed to control multiple miniature robots. As the robots themselves have very limited computational capabilities, a distributed control system is needed to coordinate tasks among a large number of robots. Two of the major c

Load Balancing for Adaptively Refined Gr
Load Balancing for Adaptively Refined Grids
✍ G. Zumbusch πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons βš– 139 KB

The solution of partial differential equations on a parallel computer is usually done by a data parallel approach. The grid is partitioned and mapped onto the processors. However, partitioning of unstructured meshes and adaptively refined meshes in general is an N P -hard problem and heuristics are

Load balancing schemes for extrapolation
Load balancing schemes for extrapolation methods
✍ Rauber, Thomas; RΓΌnger, Gudula πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 307 KB πŸ‘ 1 views

Solving initial value problems (IVPs) for ordinary differential equations (ODEs) has long been believed to be an inherently sequential procedure. But IVP solvers using the extrapolation method provide high quality solutions and offer a great potential for parallelism. In this paper, we present algor

Renaming and Dispersing: Techniques for
Renaming and Dispersing: Techniques for Fast Load Balancing
✍ J. Gil πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 775 KB

Consider the following situation: \(n\) processors of a PRAM are given \(n\) independent tasks. Each task can be executed in constant time by a single processor. The distribution of tasks among the processors is unknown; each processor has information only about its set of tasks. The batch execution