Worst case behavior of list algorithms for dynamic scheduling of non-unit execution time tasks with arbitrary precedence constrains

被引：1

作者：

Tchernykh, Andrei ^{[1
]}

Ecker, Klaus ^{[2
]}

机构：

[1] CICESE Res Ctr, Ensenada, Baja California, Mexico

[2] Ohio Univ, Athens, OH 45701 USA

来源：

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | 2008年 / E91A卷 / 08期

关键词：

list scheduling; worst case analysis; on-line scheduling;

D O I：

10.1093/ietfec/e91-a.8.2277

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Performance properties of list scheduling algorithms under various dynamic assumptions are analyzed. The focus is on bounds for scheduling directed acyclic graphs with arbitrary precedence constrains and arbitrary task processing times subject to minimizing the makespan. New performance bounds are derived and compared with known results.

引用

页码：2277 / 2280

页数：4