Sciweavers

Share
CJ
2008

Average-Case Performance Analysis Of Online Non-Clairvoyant Scheduling Of Parallel Tasks With Precedence Constraints

9 years 10 months ago
Average-Case Performance Analysis Of Online Non-Clairvoyant Scheduling Of Parallel Tasks With Precedence Constraints
We evaluate the average-case performance of three approximation algorithms for online non-clairvoyant scheduling of parallel tasks with precedence constraints. We show that for a class of wide task graphs, when task sizes
Keqin Li
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where CJ
Authors Keqin Li
Comments (0)
books