Adaptive strategy for on-line scheduling of real world parallel applications

被引：0

作者：

Tchernykh, A ^{[1
]}

Trystram, D ^{[1
]}

机构：

[1] Ctr Invest Cient & Educ Super Ensenada, Ensenada, Baja California, Mexico

来源：

6TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL XVI, PROCEEDINGS: COMPUTER SCIENCE III | 2002年

关键词：

parallelism; on-line scheduling; adaptive strategy; parallel jobs;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

In this paper, we characterize various types of problems, occurring in the implementation of real world parallel applications and provide a generic scheme for their efficient on-line scheduling. We present experimental results for the performance analysis of a new family of strategies, called adaptive (a, b, c)-Scheme. This scheme is used as a framework of the non-clairvoyant scheduler such that it is capable of dynamically changing the scheduling algorithm.. and of modifying the number of processors allocated to jobs during their execution in order to optimize system behavior.

引用

页码：354 / 359

页数：6

共 20 条

[11]

FEITELSON DG, 1996, LECT NOTES COMPUTER, V1162, P1

[12] THE PROCESSOR WORKING SET AND ITS USE IN SCHEDULING MULTIPROCESSOR SYSTEMS [J].

GHOSAL, D ;

SERAZZI, G ;

TRIPATHI, SK .

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1991, 17 (05) :443-453

[13]

GRAHAM RL, 1966, BELL SYST TECH J, V45, P263

[14]

Konig J.-C., 1998, PARALLEL ALGORITHMS, V13, P117

[15]

LEPERE R, 1999, MALLEABLE TASKS EFFI

[16]

Ludwig Walter T, 1995, THESIS U WISCONSIN M

[17]

MOUNIE G, 1999, 11 ACM S PAR ALG ARC

[18]

RAPINE C, 1998, LNCS

[19]

ROSTI E, 1995, LECT NOTES COMPUTER, V949, P165

[20]

ZAHORJAN J, 1990, SIGMETRICS, P214

← 1 2 →