M. Adler, Y. Gong, and A. L. Rosenberg, Asymptotically optimal worksharing in HNOWs: How long is "sufficiently long?, 36th Annual Simulation Symposium, pp.39-46, 2003.

M. Adler, Y. Gong, and A. L. Rosenberg, On "exploiting" nodeheterogeneous clusters optimally. Theory of Computing Systems, vol.42, pp.465-487, 2008.

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.

H. Remzi, A. C. Arpaci, . Dusseau, M. Amin, L. T. Vahdat 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. Leighton, Making commitments in the face of uncertainty: How to pick a winner almost every time, 28th ACM SToC, pp.519-530, 1996.

M. Banikazemi, V. Moorthy, and D. K. Panda, Efficient collective communication on heterogeneous networks of workstations, Intl. Conf. on Parallel Processing (ICPP), pp.460-467, 1998.

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

D. Gerassimos and . Barlas, Collection-aware optimum sequencing of operations and closed-form solutions for the distribution of a divisible load on arbitrary processor trees, IEEE Trans. Parallel Distrib. Syst, vol.9, issue.5, pp.429-441, 1998.

O. Beaumont, L. Carter, J. Ferrante, A. Legrand, and Y. Robert, Bandwidth-centric allocation of independent tasks on heterogeneous platforms, 16th Intl. Parallel and Distributed Processing Symp. (IPDPS), 2002.
URL : https://hal.archives-ouvertes.fr/inria-00072412

O. Beaumont, L. Marchal, and Y. Robert, Scheduling divisible loads with return messages on heterogeneous master-worker platforms, Intl. Conf. on High Performance Computing HiPC'2005, vol.3769, pp.498-507, 2005.
URL : https://hal.archives-ouvertes.fr/hal-02102504

A. Michael, C. A. Bender, and . Phillips, Scheduling dags on asynchronous processors, 19th ACM SPAA, pp.35-45, 2007.

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

N. Sandeep, F. R. Bhatt, . Chung, A. L. Frank-thomson-leighton, and . 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 service-oriented grid computing, 10th Heterogeneous Computing Workshop, 2001.

Y. Cheng and T. G. Robertazzi, Distributed computation for a tree network with communication delays, IEEE Transactions on Aerospace and Electronic Systems, vol.26, issue.3, pp.511-516, 1990.

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

P. Dutot, Master-slave tasking on heterogeneous processors, 17th Intl. Parallel and Distributed Processing Symp. (IPDPS), 2003.
URL : https://hal.archives-ouvertes.fr/inria-00001081

, 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.

P. Fraigniaud, B. Mans, and A. L. Rosenberg, Efficient trigger-broadcasting in heterogeneous clusters, J. Parallel Distrib. Comput, vol.65, issue.5, pp.628-642, 2005.

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.

R. Kesavan, K. Bondalapati, and D. K. Panda, Multicast on irregular switch-based networks with wormhole routing, 3rd IEEE Symp. on High-Performance Computer Architecture, pp.48-57, 1997.

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, Computing in Science & Engineering, vol.3, issue.1, 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 wide-area distributed computing environments, Euro-Par 2005 Parallel Processing, vol.3648, pp.432-441, 2005.

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

J. S. Plank and W. R. 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, Sharing partitionable workloads in heterogeneous nows: Greedier is not better, IEEE Intl. Conf. on Cluster Computing (CLUSTER 2001), pp.124-131, 2001.

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.

B. Veeravalli, D. Ghose, and V. Mani, Optimal sequencing and arrangement in distributed single-level tree networks with communication delays, IEEE Trans. Parallel Distrib. Syst, vol.5, issue.9, pp.968-976, 1994.

B. Veeravalli, D. Ghose, and V. Mani, Multi-installment load distribution in tree networks with delays, IEEE Transactions on Aerospace and Electronic Systems, vol.31, issue.2, pp.555-567, 1995.

S. W. White and D. C. 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.

Y. Yang and H. Casanova, Umr: A multi-round algorithm for scheduling divisible workloads, 17th Intl. Parallel and Distributed Processing Symp. (IPDPS), p.24, 2003.