GENERALIZED WORST-CASE BOUNDS FOR AN HOMOGENEOUS MULTIPROCESSOR MODEL WITH INDEPENDENT MEMORIES - COMPLETION-TIME PERFORMANCE CRITERION

被引：3

作者：

SPYROPOULOS, CD

EVANS, DJ

机构：

[1] NATL RES CTR DEMOCRITOS,DEPT COMP SCI,GR-15310 AGHIA PARASKEVI,GREECE

[2] LOUGHBOROUGH UNIV TECHNOL,DEPT COMP STUDIES,LOUGHBOROUGH LE11 3TU,LEICS,ENGLAND

来源：

PERFORMANCE EVALUATION | 1985年 / 5卷 / 04期

关键词：

COMPUTER OPERATING SYSTEMS - COMPUTER SYSTEMS PROGRAMMING - Supervisory and Executive Programs;

D O I：

10.1016/0166-5316(85)90023-9

中图分类号：

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

学科分类号：

0812 ;

摘要：

This paper deals with the performance of the Priority-Driven scheduling algorithm, under various preset ordering rules, on a homogeneous multiprocessor computing model with independent memories. The performance criterion used is the completion time of the schedules. For each ordering rule we prove informative worst-case bounds that generalize the ones derived earlier by D. G. Kafura and V. Y. Shen.

引用

页码：225 / 234

页数：10