, a distributed dynamic real-time scheduling algorithm, Progress in computer research, pp.170-184, 2001.
, A distributed algorithm for constructing a minimum diameter spanning tree, Journal of Parallel and Distributed Computing, vol.64, issue.5, pp.571-577, 2004.
DOI : 10.1016/j.jpdc.2004.03.009
URL : https://hal.archives-ouvertes.fr/hal-00915195
, ? « Approximating the minimum degree spanning tree to within one from the optimal degree, ACM-SIAM Symposium on Discrete Algorithms, pp.317-324
, A Distributed Algorithm for Minimum-Weight Spanning Trees, ACM Transactions on Programming Languages and Systems, vol.5, issue.1, pp.66-77, 1983.
DOI : 10.1145/357195.357200
, A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees, SIAM Journal on Computing, vol.27, issue.1, pp.302-316, 1979.
DOI : 10.1137/S0097539794261118
, Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey, Annals of Dis. Math, vol.5, 1979.
DOI : 10.1016/S0167-5060(08)70356-X
, Butelle (Franck) ? « A new on-line scheduling algorithm for distributed real-time system, Proc. of the 3rd Int. Symp. and School on Advanced Distributed Systems, pp.241-251
, Scheduling Precedence Graphs in Systems with Interprocessor Communication Times, SIAM Journal on Computing, vol.18, issue.2, pp.244-257, 1989.
DOI : 10.1137/0218016
, ? « Bubble scheduling : A quasi dynamic algorithm for static allocation of tasks to parallel architectures, Proc. 7th IEEE Symp. on Parallel and Distr. Processing, pp.36-43
, Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessors, IEEE Transactions on Parallel and Distributed Systems, vol.7, issue.5, pp.506-521, 1996.
DOI : 10.1109/71.503776
, ? « Distributed schedulings of tasks with deadlines and resource requirements, Stankovic (John A.) et Zhao Proc. IEEE trans. on ComputersRayn91] Raynal (Michel). ? La communication et le temps dans les réseaux et les sytèmes répartis. ? Eyrolles, pp.211-221, 1987.