MULTIPROCESSOR SCHEDULING AND EXPANDERS

被引：0
|
作者：
KUZJURIN, NN
机构：
[1] Institute for Cybernetics Problems, Russian Academy of Sciences, 1173312 Moscow
来源：
INFORMATION PROCESSING LETTERS | 1994年 / 51卷 / 06期
关键词：
SCHEDULING; EXPANDER; DIRECTED ACYCLIC GRAPH (DAG);
D O I：
10.1016/0020-0190(94)00101-4
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We prove that the non-existence of expanders with high expansion implies the existence of an ideal p-processor scheduling for directed acyclic graphs (dags) with maximum in-degree d and all levels of size greater than (1+ (2 ln ln d)/ln d)(d/ln d)p for sufficiently large d and p.
引用
收藏
页码：315 / 319
页数：5
相关论文
共 50 条
12345