SCHEDULING COMPLETE INTREES ON 2 UNIFORM PROCESSORS WITH COMMUNICATION DELAYS

Authors
BLAZEWICZ J BOUVRY P GUINARD F TRYSTRAM D
Citation
J. Blazewicz et al., SCHEDULING COMPLETE INTREES ON 2 UNIFORM PROCESSORS WITH COMMUNICATION DELAYS, Information processing letters, 58(5), 1996, pp. 255-263
Citations number
7
Categorie Soggetti
Information Science & Library Science","Computer Science Information Systems
Journal title
Information processing letters → ACNP
ISSN journal
00200190
Volume
58
Issue
5
Year of publication
1996
Pages
255 - 263
Database
ISI
SICI code
0020-0190(1996)58:5<255:SCIO2U>2.0.ZU;2-H
Abstract
We present an optimal algorithm for scheduling a complete k-ary tree o n two uniform processors of different speeds in order to minimize sche dule length. We consider the basic case of unit standard execution tim es and unit communication times.