Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

IJHPCA
2006

favoriteEmaildiscussreport

75views more IJHPCA 2006»

Scheduling Multiple Divisible Loads

13 years 4 months ago

Scheduling Multiple Divisible Loads

Download www-lih.univ-lehavre.fr

In this paper we study the scheduling of multiple divisible loads on a star network of processors. We show that this problem is computationally hard. Special cases solvable in polynomial time are identified. Key words: divisible loads, scheduling, computational complexity

Maciej Drozdowski, Marcin Lawenda, Fréd&eac

Real-time Traffic

Divisible Loads | IJHPCA 2006 | Multiple Divisible Loads | Star Network |

claim paper

Related Content

» Scheduling multiple divisible loads on a linear processor network

» Comments on Design and performance evaluation of load distribution strategies for multiple...

» Divisible load scheduling with improved asymptotic optimality

» Scheduling Divisible Workloads from Multiple Sources in Linear Daisy Chain Networks

» A Strategyproof Mechanism for Scheduling Divisible Loads in Distributed Systems

» Divisible Load Scheduling An Approach Using Coalitional Games

» A Strategyproof Mechanism for Scheduling Divisible Loads in Linear Networks

» Practical Divisible Load Scheduling on Grid Platforms with APSTDV

» A Dynamic Scheduling Algorithm for Divisible Loads in Grid Environments

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2006
Where	IJHPCA
Authors	Maciej Drozdowski, Marcin Lawenda, Frédéric Guinand

Comments (0)