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

In this paper, we present an algorithm that builds optimal schedules for complete in-trees on two uniform processors, with arbitrary integer speed ratios, in the presence of communication delays.

Mots clés

Scheduling communication delays complete in-trees uniform processors

Domaines

Recherche opérationnelle [math.OC]

Bernard Penz : Connectez-vous pour contacter le contributeur

https://hal.science/hal-00239338

Soumis le : mardi 5 février 2008-15:00:03

Dernière modification le : vendredi 5 avril 2024-03:14:07

Dates et versions

hal-00239338 , version 1 (05-02-2008)

Identifiants

HAL Id : hal-00239338 , version 1
DOI : 10.1142/S0129626400000263

Citer

Jacek Blazewicz, Frédéric Guinand, Bernard Penz, Denis Trystram. Scheduling complete trees on two uniform processors with integer speed ratios and communication delays. Parallel Processing Letters, 2000, 10 (4), pp.267-277. ⟨10.1142/S0129626400000263⟩. ⟨hal-00239338⟩

Exporter

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UGA IMAG CNRS INRIA G-SCOP G-SCOP_OSP_ROSP G-SCOP_OSP INRIA2 TDS-MACS LMC-IMAG

123 Consultations

0 Téléchargements