Scheduling complete trees on two uniform processors with integer speed ratios and communication delays

Parallel Processing Letters

Volumn 10, Issue 4, 2000, Pages 267-277

  Blazewicz, J ^a,b   Guinand, F ^c   Penz, B ^d   Trystram, D ^e  

^a Institute of Computing Science   (Poland)

^b University of Technology   (Poland)

^c Laboratoire d'Informatique du Havre   (France)

^d INP Grenoble ENSGI   (France)

^e INP Grenoble ENSIMAG   (France)

Author keywords

Communication delays; Complete in trees; Scheduling; Uniform processors

Indexed keywords

DATA COMMUNICATION SYSTEMS; DATA STRUCTURES; PARALLEL ALGORITHMS; RESPONSE TIME (COMPUTER SYSTEMS); SCHEDULING;

COMMUNICATION DELAYS; INTEGER SPEED RATIOS;

PARALLEL PROCESSING SYSTEMS;

EID: 0034439140     PISSN: 01296264     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129626400000263     Document Type: Article

References (10)

1. Parallel sequencing and assembly line problems
2. The complexity of scheduling trees with communication delays
3. Étude des Problèmes d'Optimisation dans les Systèmes Distribués
4. Scheduling trees with communication delays on several kinds of processors
5. Scheduling in and out forests in the presence of communication delays
6. The complexity of scheduling problems with communication delays for trees
7. Optimal scheduling on two processors of different speeds
8. Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints
9. Scheduling complete in-trees on two uniform processors with communication delays
10. UET scheduling with unit interprocessor communication delays