C. Anglano, J. Brevik, M. Canonico, D. Nurmi, and R. Wolski, Fault-aware scheduling for bag-of-tasks applications on desktop grids, GRID '06, pp.56-63, 2006.

R. H. Arpaci, A. C. Dusseau, A. M. Vahdat, L. T. Liu, T. E. Anderson et al., The interaction of parallel and sequential workloads on a network of workstations, SIGMETRICS '95/PERFORMANCE '95, pp.267-278, 1995.

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

O. Beaumont, H. Casanova, A. Legrand, Y. Robert, and Y. Yang, Scheduling divisible loads on star and tree networks: results and open problems, IEEE TPDS, vol.16, issue.3, pp.207-218, 2005.
DOI : 10.1109/tpds.2005.35
URL : https://hal.archives-ouvertes.fr/inria-00071663

M. A. Bender and C. A. Phillips, Scheduling dags on asynchronous processors, 19th ACM SPAA, pp.35-45, 2007.
DOI : 10.1145/1248377.1248384
URL : http://www.cs.sunysb.edu/%7Ebender/newpub/BenderPh07.pdf

A. Benoit, Y. Robert, A. L. Rosenberg, and F. Vivien, Static strategies for worksharing with unrecoverable interruptions, 23rd Intl. Parallel and Distributed Processing Symp. (IPDPS), 2009.
DOI : 10.1109/ipdps.2009.5161044
URL : https://hal.archives-ouvertes.fr/hal-01059271

A. Benoit, Y. Robert, A. L. Rosenberg, and F. Vivien, Static strategies for worksharing with unrecoverable interruptions, 2010.
DOI : 10.1109/ipdps.2009.5161044
URL : https://hal.archives-ouvertes.fr/hal-01059271

A. Benoit, Y. Robert, A. L. Rosenberg, and F. Vivien, Static worksharing strategies for heterogeneous computers with unrecoverable interruptions, Parallel Computing, 2010.
DOI : 10.1016/j.parco.2010.03.001
URL : https://hal.archives-ouvertes.fr/hal-00945070

V. Bharadwaj, D. Ghose, V. Mani, and T. G. Robertazzi, Scheduling Divisible Loads in Parallel and Distributed Systems, 1996.

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

R. Buyya, D. Abramson, and J. Giddy, A case for economy grid architecture for serviceoriented grid computing, 10th Heterogeneous Computing Workshop, 2001.

W. Cirne and K. Marzullo, The computational co-op: Gathering clusters into a metacomputer, 13th Intl. Parallel Processing Symp. (IPPS), pp.160-166, 1999.

, The Grid 2: Blueprint for a New Computing Infrastructure, 2004.

I. Foster, C. Kesselman, and S. Tuecke, The anatomy of the grid: Enabling scalable virtual organizations, Intl. J. High Performance Computing Applications, vol.15, issue.3, pp.200-222, 2001.

M. Gallet, Y. Robert, and F. Vivien, Comments on "design and performance evaluation of load distribution strategies for multiple loads on heterogeneous linear daisy chain networks, J. Parallel Distributed Computing, vol.68, issue.7, pp.1021-1031, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00130294

M. Gallet, Y. Robert, and F. Vivien, Divisible load scheduling. In: Introduction to Scheduling, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00786385

L. Gao and G. Malewicz, Toward maximizing the quality of results of dependent tasks computed unreliably, Theory Comput. Syst, vol.41, issue.4, pp.731-752, 2007.

D. Kondo, Scheduling task parallel applications for rapid turnaround on enterprise desktop grids, 2005.

D. Kondo, H. Casanova, E. Wing, and F. Berman, Models and scheduling mechanisms for global computing applications, 16th Intl. Parallel and Distr. Processing Symp. (IPDPS), 2002.

E. Korpela, D. Werthimer, D. Anderson, J. Cobb, and M. Leboisky, SETI@home-Massively Distributed Computing for SETI, vol.3, pp.78-83, 2001.

M. J. Litzkow, M. Livny, and M. W. Mutka, Condor-a hunter of idle workstations, ICDCS, pp.104-111, 1988.

G. Malewicz, A. L. Rosenberg, and M. Yurkewych, Toward a theory for scheduling dags in internet-based computing, IEEE Trans. Computers, vol.55, issue.6, pp.757-768, 2006.

D. Nurmi, J. Brevik, and R. Wolski, Modeling machine availability in enterprise and widearea distributed computing environments, Euro-Par, vol.3648, pp.432-441, 2005.

G. F. Pfister, Search of Clusters, 1995.

J. Plank and W. Elwasif, Experimental assessment of workstation failures and their impact on checkpointing systems, Fault-Tolerant Computing, pp.48-57, 1998.

A. L. Rosenberg, Guidelines for data-parallel cycle-stealing in networks of workstations i: On maximizing expected output, J. Parallel Distrib. Comput, vol.59, issue.1, pp.31-53, 1999.

A. L. Rosenberg, Guidelines for data-parallel cycle-stealing in networks of workstations ii: On maximizing guaranteed output, Intl. J. Foundations of Computer Science, vol.11, issue.1, pp.183-204, 2000.

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

A. L. Rosenberg, Changing challenges for collaborative algorithmics, Handbook of Nature-Inspired and Innovative Computing: Integrating Classical Models with Emerging Technologies, pp.1-44, 2006.

S. White and D. Torney, Use of a workstation cluster for the physical mapping of chromosomes, pp.14-17, 1993.

J. Wingstrom and H. Casanova, Probabilistic allocation of tasks on desktop grids, Proceedings of PCGrid, 2008.