J. Abawajy, Fault-tolerant scheduling policy for grid computing systems, International Parallel and Distributed Processing Symposium IPDPS, 2004.

B. Awerbuch, Y. Azar, A. Fiat, and F. Leighton, Making commitments in the face of uncertainty: how to pick a winner almost every time, 28th ACM Symp. on Theory of Computing, pp.519-530, 1996.

H. Aydin, R. Melhem, D. Mosse, and P. M. Alvarez, Power-aware scheduling for periodic real-time systems, IEEE Trans. Computers, vol.53, issue.5, pp.584-600, 2004.

C. Banino, O. Beaumont, L. Carter, J. Ferrante, A. Legrand et al., Scheduling strategies for master-slave tasking on heterogeneous processor platforms, IEEE Trans. Parallel Distributed Systems, vol.15, issue.4, pp.319-330, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00789427

O. Beaumont, L. Carter, J. Ferrante, A. Legrand, L. Marchal et al., Centralized versus distributed schedulers for bag-of-tasks applications, IEEE Trans. Parallel Distributed Systems, vol.19, issue.5, pp.698-709, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00789424

A. Benoit and Y. Robert, Complexity results for throughput and latency optimization of replicated and data-parallel workflows. Algorithmica, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00980695

D. Bertsimas and D. Gamarnik, Asymptotically optimal algorithms for job shop scheduling and packet routing, Journal of Algorithms, vol.33, issue.2, pp.296-318, 1999.

P. Bhat, C. Raghavendra, and V. Prasanna, Efficient collective communication in distributed heterogeneous systems, ICDCS'99 19th International Conference on Distributed Computing Systems, pp.15-24, 1999.

P. Bhat, C. Raghavendra, and V. Prasanna, Efficient collective communication in distributed heterogeneous systems, Journal of Parallel and Distributed Computing, vol.63, pp.251-263, 2003.

S. Bhatt, F. Chung, F. Leighton, and A. Rosenberg, On optimal strategies for cycle-stealing in networks of workstations, IEEE Trans. Computers, vol.46, issue.5, pp.545-557, 1997.

, BOINC: Berkeley Open Infrastructure for Network Computing

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2001.

A. Duarte, D. Rexachs, and E. Luque, A distributed scheme for fault-tolerance in large clusters of workstations, In NIC Series, vol.33, pp.473-480, 2006.

A. H. Frey and G. Fox, Problems and approaches for a teraflop processor, Proceedings of the Third Conference on Hypercube Concurrent Computers and Applications, pp.21-25, 1988.

A. Geist and C. Engelmann, Development of naturally fault tolerant algorithms for computing on 100, 2002.

B. Hong and V. K. Prasanna, Adaptive allocation of independent tasks to maximize throughput, IEEE Trans. Parallel Distributed Systems, vol.18, issue.10, pp.1420-1435, 2007.

N. T. Karonis, B. Toonen, and I. Foster, Mpich-g2: A grid-enabled implementation of the message passing interface, J.Parallel and Distributed Computing, vol.63, issue.5, pp.551-563, 2003.

S. H. Low, A Duality Model of TCP and Queue Management Algorithms, IEEE/ACM Trans. Networking, vol.4, issue.11, pp.525-536, 2003.

L. Massoulié and J. Roberts, Bandwidth sharing: Objectives and algorithms, Transactions on Networking, vol.10, issue.3, pp.320-328, 2002.

A. Rosenberg, Optimal schedules for cycle-stealing in a network of workstations with a bag-of-tasks workload, IEEE Trans. Parallel and Distributed Systems, vol.13, issue.2, pp.179-191, 2002.

T. Saif and M. Parashar, Understanding the behavior and performance of non-blocking communications in MPI, Proceedings of Euro-Par 2004: Parallel Processing, vol.3149, pp.173-182, 2004.

J. Subhlok and G. Vondran, Optimal latencythroughput tradeoffs for data parallel pipelines, ACM Symposium on Parallel Algorithms and Architectures SPAA'96, pp.62-71, 1996.
DOI : 10.1145/237502.237508

C. Wen-hsiung, C. Smith, and S. Fralick, A Fast Computational Algorithm for the Discrete Cosine Tranfsorm, IEEE Transactions on Communications, vol.25, issue.9, pp.1004-1009, 1977.