๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Scheduling of stochastic tasks on two parallel processors

โœ Scribed by Michael Pinedo; Gideon Weiss

Publisher
John Wiley and Sons
Year
1979
Tongue
English
Weight
457 KB
Volume
26
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Toward Efficient Scheduling of Evolving
Toward Efficient Scheduling of Evolving Computations on Rings of Processors
โœ Li-Xin Gao; Arnold L. Rosenberg ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 320 KB

We study a simple, low-overhead policy for scheduling dynamically evolving computations in which tasks that spawn produce precisely two offspring, on rings of processors. Such computations include, for instance, tree-structured branching computations. We believe that our policy yields good parallel

Simulated annealing task to processor ma
Simulated annealing task to processor mapping for domain decomposition methods on distributed parallel computers
โœ Pain, C. C.; de Oliveira, C. R. E.; Goddard, A. J. H. ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 706 KB

The parallel solution of large sets of equations derived from finite element or finite difference methods often involves the use of domain decomposition methods. This paper is concerned with the related problem of mapping subdomain partitioning to a processor topology in such a way that the communic

Randomized On-line Scheduling of Paralle
Randomized On-line Scheduling of Parallel Jobs
โœ Jiล™ฤฑ́ Sgall ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 230 KB

We study randomized on-line scheduling on mesh machines. We show that for scheduling independent jobs randomized algorithms can achieve a significantly better performance than deterministic ones; on the other hand with dependencies randomization does not help.