SCHEDULING ON A HYPERCUBE

被引：2

作者：

SHEN, XJ ^{[1
]}

REINGOLD, EM ^{[1
]}

机构：

[1] UNIV ILLINOIS,DEPT COMP SCI,URBANA,IL 61801

来源：

INFORMATION PROCESSING LETTERS | 1991年 / 40卷 / 06期

关键词：

HYPERCUBE; SCHEDULING; ANALYSIS OF ALGORITHMS; DESIGN OF ALGORITHMS; COMPUTER ARCHITECTURE;

D O I：

10.1016/0020-0190(91)90201-R

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We present a THETA(n2) worst-case-time algorithm to determine the minimum finishing time for a preemptive schedule of n independent jobs on a hypercube of fixed dimension.

引用

页码：323 / 328

页数：6

共 9 条

[1] AN O(N LOG N) FEASIBILITY ALGORITHM FOR PREEMPTIVE SCHEDULING OF N INDEPENDENT JOBS ON A HYPERCUBE [J].

AHUJA, M ;

ZHU, YH .

INFORMATION PROCESSING LETTERS, 1990, 35 (01) :7-11

[2] PREEMPTIVE SCHEDULING OF INDEPENDENT JOBS ON A HYPERCUBE [J].

CHEN, GI ;

LAI, TH .

INFORMATION PROCESSING LETTERS, 1988, 28 (04) :201-206

[3] PREEMPTIVE SCHEDULING TO MINIMIZE MAXIMUM COMPLETION-TIME ON UNIFORM PROCESSORS WITH MEMORY CONSTRAINTS [J].

MARTEL, C .

OPERATIONS RESEARCH, 1985, 33 (06) :1360-1380

[4]

Megiddo N., 1979, Mathematics of Operations Research, V4, P414, DOI 10.1287/moor.4.4.414

[5] THE COSMIC CUBE [J].

SEITZ, CL .

COMMUNICATIONS OF THE ACM, 1985, 28 (01) :22-33

[6]

Stein C, 2001, INTRO ALGORITHMS 2 V, Vsecond

[7] NP-COMPLETE SCHEDULING PROBLEMS [J].

ULLMAN, JD .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1975, 10 (03) :384-393

[8]

Zhu Y., 1990, Proceedings. The 10th International Conference on Distributed Computing Systems (Cat. No.90CH2878-7), P510, DOI 10.1109/ICDCS.1990.89321

[9]

[No title captured]

← 1 →