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

• Type: Journal
• Year: 2008
• Where: CJ
• Authors: Keqin Li
• Keywords: Average-case Performance, CJ 2008, Online Non-clairvoyant Scheduling, Wide Task Graphs