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

Jacek Blazewicz Frédéric Guinand 1 Bernard Penz 2 Denis Trystram 1, 3, 4, 5
2 G-SCOP_ROSP - ROSP
G-SCOP - Laboratoire des sciences pour la conception, l'optimisation et la production
4 APACHE - Parallel algorithms and load sharing
ID-IMAG - Informatique et Distribution, Inria Grenoble - Rhône-Alpes, UJF - Université Joseph Fourier - Grenoble 1
5 MOAIS - PrograMming and scheduling design fOr Applications in Interactive Simulation
ID-IMAG - Informatique et Distribution, Inria Grenoble - Rhône-Alpes, UJF - Université Joseph Fourier - Grenoble 1
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00239338
Contributor : Bernard Penz <>
Submitted on : Tuesday, February 5, 2008 - 3:00:03 PM
Last modification on : Wednesday, March 13, 2019 - 3:02:04 PM

Identifiers

  • HAL Id : hal-00239338, version 1

Collections

Citation

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, World Scientific Publishing, 2000, 10 (4), pp.267-277. ⟨hal-00239338⟩

Share

Metrics

Record views

350