E. Bampis, R. Giroudeau, and J.C. König,
``Using duplication for multiprocessor scheduling problem with hierarchical communications,'' Parallel Processing Letters, 10(1):133-140, 2000.
[2]
E. Bampis and R. Giroudeau and J.C. König,
``On the hardness of approximating the precedence constrained multiprocessor scheduling problem with hierarchical communications'', LaMI,Technical report 34, accepté à RAIRO-RO.
[3]
E. Bampis, R. Giroudeau, and J.C. König,
``An approximation algorithm for precedence constrained scheduling problem with hierarchical communications'', accepté à TCS.
[4]
E. Bampis, R. Giroudeau, and A. Kononov,
``How to schedule precedence constrained tasks with small hierarchical communication delays'' soumis à Operations Research.
Conférences internationales avec comité de lecture
[5]
E. Bampis, R. Giroudeau, and J.C. König,
``Using duplication for multiprocessor scheduling problem with hierarchical communications,''
Proceedings of Europar'99, LNCS, No. 1685, pages 369-372, (version étendue dans [1]).
[6]
E. Bampis, R. Giroudeau, and J.C. König,
``An approximation algorithm for precedence constrained scheduling problem with hierarchical communications,''
Proceedings of STACS'2000, LNCS No. 1770, pages 443-454.
[7]
E. Bampis, R. Giroudeau, and A. Kononov,
``How to schedule precedence constrained tasks with small hierarchical communication delays'',
Proceedings of ACM SPAA'2001, pages 314-315.
[8]
E. Angel, E. Bampis, and R. Giroudeau,
``Non-approximability results for the hierarchical communication problem with a bounded number of clusters'', soumis à STACS'2002.
Conférence nationale avec comité de lecture
[9]
E. Bampis, R. Giroudeau, and J.C. König,
``L'impact des communications hiérarchiques sur les problèmes
d'ordonnancement,''
Actes de Renpar'11, pages 97-102.
Conférences invitées
[10]
E. Bampis, R. Giroudeau, and J.C. König,
``Some results on scheduling in the presence of hierarchical communications,''
JIM'99. Metz, mai 1999.
[11]
E. Bampis, R. Giroudeau, and J.C. König,
``Approximation results for the precedence constrained multiprocessors
scheduling,''
International Conference on Optimization. Trier (Allemagne),
mars 1999.
Rapports de recherches
[12]
R. Giroudeau
``L'impact des délais de communications hiérarchiques sur la complexité et l'approximation des problèmes d'ordonnancement''.
Doctorat, Université d'Évry Val d'Essonne, Décembre 2000.
[13]
R. Giroudeau
``Non-approximability results for scheduling problem in presence of hierarchical communication''.
En préparation.
