OPTIMAL SCHEDULING STRATEGIES IN A MULTIPROCESSOR SYSTEM

被引：104

作者：

RAMAMOORTHY, CV

CHANDY, KM

GONZALEZ, MJ

机构：

来源：

IEEE TRANSACTIONS ON COMPUTERS | 1972年 / C 21卷 / 02期

关键词：

D O I：

10.1109/TC.1972.5008918

中图分类号：

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

学科分类号：

0812 ;

摘要：

Using a directed graph model to represent a computational process, two basic problems are solved. Given a set of computational tasks and the relationships between them, the tasks are scheduled such that the total execution time is minimized, and the minimum number of processors required to realize this schedule is obtained. The second problem is of a more general nature. Given k processors, the tasks are scheduled such that execution time is again minimized. Consideration is given to tasks of equal and unequal duration, and task preemption is not allowed.

引用

页码：137 / +

页数：1

共 14 条

[1] Bellman R. E., 1962, APPL DYNAMIC PROGRAM
[2] ANALYSIS OF PROGRAMS FOR PARALLEL PROCESSING
BERNSTEIN, AJ
[J]. IEEE TRANSACTIONS ON ELECTRONIC COMPUTERS, 1966, EC15 (05): : 757 - +
[3] GRAHAM RL, 1969, SIAM J APPL MATH, V17
[4] PARALLEL SEQUENCING AND ASSEMBLY LINE PROBLEMS
HU, TC
[J]. OPERATIONS RESEARCH, 1961, 9 (06) : 841 - 848
[5] Karp R.M., 1969, J COMPUT SYST SCI, V3, P147
[6] KARP RM, 1967, SIAM J APPL MATH, V15
[7] MANACHER GK, 1967, J ASSOC COMPUT MACH, V14, P429
[8] DISTINGUISHABILITY CRITERIA IN ORIENTED GRAPHS AND THEIR APPLICATION TO COMPUTER DIAGNOSIS .I.
MAYEDA, W
RAMAMOORTHY, CV
[J]. IEEE TRANSACTIONS ON CIRCUIT THEORY, 1969, CT16 (04): : 448 - +
[9] OPTIMAL PREEMPTIVE SCHEDULING ON 2-PROCESSOR SYSTEMS
MUNTZ, RR
COFFMAN, EG
[J]. IEEE TRANSACTIONS ON COMPUTERS, 1969, C 18 (11) : 1014 - &
[10] ANALYSIS OF GRAPHS BY CONNECTIVITY CONSIDERATIONS
RAMAMOORTHY, CV
[J]. JOURNAL OF THE ACM, 1966, 13 (02) : 211 - +

← 1 2 →