. Transparency, http://serverfault.com/questions/124595/ how-do-i-get-transparent-efficient-file-system-snapshotting-or-versioning-on-e

G. Aggarwal, R. Motwani, and A. Zhu, The load rebalancing problem, Journal of Algorithms, vol.60, issue.1, pp.42-59, 2006.
DOI : 10.1016/j.jalgor.2004.10.002

D. T. Altilar and Y. Paker, Optimal scheduling algorithms for communication constrained parallel processing. Lecture notes in computer science, pp.197-206
DOI : 10.1007/3-540-45706-2_25

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.8834

D. P. Anderson, BOINC: A System for Public-Resource Computing and Storage, Fifth IEEE/ACM International Workshop on Grid Computing, pp.365-372, 2004.
DOI : 10.1109/GRID.2004.14

D. P. Anderson, J. Cobb, E. Korpela, M. Lebofsky, and D. Werthimer, SETI@home: an experiment in public-resource computing, Communications of the ACM, vol.45, issue.11, pp.56-61, 2002.
DOI : 10.1145/581571.581573

G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-spaccamela et al., Complexity and approximation : Combinatorial optimization problems and their approximability properties, 1999.
DOI : 10.1007/978-3-642-58412-1

K. R. Baker, Introduction to sequencing and scheduling, 1974.

C. Banino, O. Beaumont, L. Carter, J. Ferrante, A. Legrand et al., Scheduling strategies for master-slave tasking on heterogeneous processor platforms, IEEE Transactions on Parallel and Distributed Systems, vol.15, issue.4, pp.319-330, 2004.
DOI : 10.1109/TPDS.2004.1271181

URL : https://hal.archives-ouvertes.fr/hal-00789427

M. E. Baran and F. F. Wu, Network reconfiguration in distribution systems for loss reduction and load balancing. Power Delivery, IEEE Transactions on, vol.4, issue.2, pp.1401-1407, 1989.

O. Beaumont, H. Casanova, A. Legrand, Y. Robert, and Y. Yang, Scheduling divisible loads on star and tree networks: results and open problems, IEEE Transactions on Parallel and Distributed Systems, vol.16, issue.3, pp.207-218, 2005.
DOI : 10.1109/TPDS.2005.35

URL : https://hal.archives-ouvertes.fr/inria-00358949

O. Beaumont, A. Legrand, L. Marchal, and Y. Robert, Pipelining Broadcasts on Heterogeneous Platforms, IEEE Transactions on Parallel and Distributed Systems, pp.300-313, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00807285

O. Beaumont, L. E. Dubois, H. Rejeb, and C. Thraves, Allocation of Clients to Multiple Servers on Large Scale Heterogeneous Platforms, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00384569

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.
DOI : 10.1006/jagm.1999.1047

V. Bharadwaj, Scheduling divisible loads in parallel and distributed systems, 1996.

J. Blazewicz, M. Drabowski, J. Weglarz, I. Automatyki, and P. Pozna?ska, Scheduling Multiprocessor Tasks to Minimize Schedule Length, IEEE Transactions on Computers, vol.35, issue.5, pp.389-393, 1986.
DOI : 10.1109/TC.1986.1676781

T. D. Braun, N. Siegal, L. L. Beck, M. Boloni, A. I. Maheswaran et al., A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems, Journal of Parallel and Distributed Computing, vol.61, issue.6, pp.810-837, 2001.
DOI : 10.1006/jpdc.2000.1714

T. D. Braun, N. Siegal, L. L. Beck, M. Boloni, A. I. Maheswaran et al., A comparison study of static mapping heuristics for a class of meta-tasks on heterogeneous computing systems, Proceedings. Eighth Heterogeneous Computing Workshop (HCW'99), pp.15-29, 1999.
DOI : 10.1109/HCW.1999.765093

M. A. Brown, Classless Queuing Disciplines, Traffic Control HOWTO. Chapter, 2006.

P. Brucker, Scheduling algorithms, 2007.

P. H. Carns, W. B. Ligon, I. , R. B. Ross, and R. Thakur, PVFS : A parallel file system for Linux clusters, Proceedings of the 4th annual Linux Showcase & Conference, p.28, 2000.

H. Casanova, Modeling large-scale platforms for the analysis and the simulation of scheduling strategies, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings., 2004.
DOI : 10.1109/IPDPS.2004.1303169

H. Casanova, NETWORK MODELING ISSUES FOR GRID APPLICATION SCHEDULING, International Journal of Foundations of Computer Science, vol.16, issue.02, pp.145-162, 2005.
DOI : 10.1142/S0129054105002929

H. Casanova and L. Marchal, A network model for simulation of grid application . RR-40, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00071989

M. Castro, P. Druschel, A. M. Kermarrec, A. Nandi, A. Rowstron et al., SplitStream, ACM SIGOPS Operating Systems Review, vol.37, issue.5, pp.298-313, 2003.
DOI : 10.1145/1165389.945474

H. Chen and M. Maheswaran, Distributed dynamic scheduling of composite tasks on grid computing systems, Proceedings of the 11th IEEE Heterogeneous Computing Workshop. Citeseer, 2002.

F. Chung, R. Graham, J. Mao, and G. Varghese, Parallelism versus memory allocation in pipelined router forwarding engines, Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures , SPAA '04, pp.829-849, 2006.
DOI : 10.1145/1007912.1007928

F. Cristian, Understanding fault-tolerant distributed systems, Communications of the ACM, vol.34, issue.2, pp.56-78, 1991.
DOI : 10.1145/102792.102801

G. Cybenko, Dynamic load balancing for distributed memory multiprocessors, Journal of Parallel and Distributed Computing, vol.7, issue.2, pp.279-301, 1989.
DOI : 10.1016/0743-7315(89)90021-X

F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica, Wide-area cooperative storage with CFS

W. Day and S. Hill, Farming : towards a rigorous definition and efficient transputer implementation, p.49, 1992.

P. J. Denning, Fault Tolerant Operating Systems, ACM Computing Surveys, vol.8, issue.4, pp.359-389, 1976.
DOI : 10.1145/356678.356680

J. Edmonds, Edge disjoint branchings, Combinatorial Algorithms, p.91, 1972.

H. El-rewini, T. G. Lewis, and H. H. Ali, Task scheduling in parallel and distributed systems, 1994.

L. Epstein and R. Van-stee, Improved results for a memory allocation problem, WADS, pp.362-373, 2007.

L. Epstein and R. Van-stee, Approximation Schemes for Packing Splittable Items with Cardinality Constraints, Lecture Notes in Computer Science, vol.4927, pp.232-245, 2007.
DOI : 10.1007/978-3-540-77918-6_19

L. Eyraud-dubois, A. Legrand, M. Quinson, and F. Vivien, A First Step Towards Automatically Building Network Representations, Lecture Notes in Computer Science, vol.4641, p.160, 2007.
DOI : 10.1007/978-3-540-74466-5_18

URL : https://hal.archives-ouvertes.fr/inria-00130734

H. N. Gabow and K. Manu, Packing algorithms for arborescences (and spanning trees) in capacitated graphs, Mathematical Programming, vol.82, issue.1, pp.83-109, 1998.

M. R. Garey and D. S. Johnson, Computers and Intractability : A Guide to the Theory of NP-completeness, 1979.

S. Ghemawat, H. Gobioff, and S. Leung, The Google File System, SOSP '03 : Proceedings of the nineteenth ACM symposium on Operating systems principles, pp.29-43, 2003.

L. Golubchik, J. C. Lui, and R. R. Muntz, Chained declustering: load balancing and robustness to skew and failures, [1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing, pp.88-95, 1992.
DOI : 10.1109/RIDE.1992.227420

S. Gorn, Transparent-mode control procedures for data communication, using the American standard code for information interchange---a tutorial, Communications of the ACM, vol.8, issue.4, pp.203-206, 1965.
DOI : 10.1145/363831.363836

R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. Kan, Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey, Annals of Discrete Mathematics, vol.5, issue.2, pp.287-326, 1979.
DOI : 10.1016/S0167-5060(08)70356-X

T. Hacker, B. Athey, and B. Noble, The end-to-end performance effects of parallel TCP sockets on a lossy wide-area network, Proceedings 16th International Parallel and Distributed Processing Symposium, pp.434-443, 2002.
DOI : 10.1109/IPDPS.2002.1015527

M. Balter and A. B. Downey, Exploiting process lifetime distributions for dynamic load balancing, ACM Transactions on Computer Systems, vol.15, issue.3, pp.253-285, 1997.
DOI : 10.1145/263326.263344

B. Hong and V. K. Prasanna, Distributed adaptive task allocation in heterogeneous computing environments to maximize throughput, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings., p.52, 2004.
DOI : 10.1109/IPDPS.2004.1302974

B. Hong and V. K. Prasanna, Distributed adaptive task allocation in heterogeneous computing environments to maximize throughput, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings., 2004.
DOI : 10.1109/IPDPS.2004.1302974

R. J. Honicky and E. L. Miller, Replication under scalable hashing : A family of algorithms for scalable decentralized data distribution, IPDPS. IEEE Computer Society, 2004.

E. Horowitz and S. Sahni, Exact and Approximate Algorithms for Scheduling Nonidentical Processors, Journal of the ACM, vol.23, issue.2, pp.317-327, 1976.
DOI : 10.1145/321941.321951

J. H. Howard, M. L. Kazar, S. G. Menees, D. A. Nichols, M. Satyanarayanan et al., Scale and performance in a distributed file system, ACM Transactions on Computer Systems, vol.6, issue.1, pp.51-81, 1988.
DOI : 10.1145/35037.35059

H. Hsiao and D. J. Dewitt, Chained declustering: a new availability strategy for multiprocessor database machines, [1990] Proceedings. Sixth International Conference on Data Engineering, p.456, 1990.
DOI : 10.1109/ICDE.1990.113499

Y. Hu, D. Blake, and . Emerson, An optimal migration algorithm for dynamic load balancing. Concurrency -Practice and Experience, pp.467-483, 1998.

B. Hubert, Linux Advanced Routing & Traffic Control. Chapter 9 Queueing Disciplines for Bandwidth Management, 2002.

K. Hwang, Advanced computer architecture : parallelism, scalability, programmability, 1993.

O. H. Ibarra and C. E. Kim, Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors, Journal of the ACM, vol.24, issue.2, pp.280-289, 1977.
DOI : 10.1145/322003.322011

H. A. James, Scheduling in metacomputing systems, 1999.

P. Jogalekar and M. Woodside, Evaluating the scalability of distributed systems . Parallel and Distributed Systems, IEEE Transactions on, vol.11, issue.6, pp.589-603, 2002.

S. L. Johnsson and C. T. Ho, Optimum broadcasting and personalized communication in hypercubes, IEEE Transactions on Computers, vol.38, issue.9, pp.1249-1268, 1989.
DOI : 10.1109/12.29465

D. Karger, E. Lehman, T. Leighton, R. Panigrahy, M. Levine et al., Consistent hashing and random trees, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing , STOC '97, pp.654-663, 1997.
DOI : 10.1145/258533.258660

S. M. Larson, C. D. Snow, M. Shirts, and V. S. Pande, Folding@ Home and Genome@ Home : Using distributed computing to tackle previously intractable problems in computational biology, Computational Genomics, 2002.

C. Leangsuksun, J. Potter, and S. Scott, Dynamic task mapping algorithms for a distributed heterogeneous computing environment, 4th IEEE Heterogeneous Computing Workshop (HCW95, pp.30-34, 1995.

E. K. Lee and C. A. Thekkath, Petal, ACM SIGOPS Operating Systems Review, vol.30, issue.5, pp.84-92, 1996.
DOI : 10.1145/248208.237157

J. Karel-lenstra, D. B. Shmoys, and E. Tardos, Approximation Algorithms for scheduling unreleated parallel machines, Mathematical Progamming, p.46

Z. Li, B. Li, D. Jiang, and L. C. Lau, On achieving optimal throughput with network coding, Proceedings IEEE INFOCOM, 2005.

Q. Lian, W. Chen, and Z. Zhang, On the impact of replica placement to the reliability of distributed brick storage systems, 2005.

W. B. Ligon, I. , and R. B. Ross, An overview of the parallel virtual file system, Proceedings of the 1999 Extreme Linux Workshop. Citeseer, 1999.

M. Livny and M. Melman, Load balancing in homogeneous broadcast distributed systems, Proceedings of the Computer Network Performance Symposium, pp.47-55, 1982.

M. Maheswaran, S. Ali, D. Siegal, R. F. Hensgen, and . Freund, Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems, Proceedings. Eighth Heterogeneous Computing Workshop (HCW'99), pp.30-44, 1999.
DOI : 10.1109/HCW.1999.765094

L. Massoulie and J. Roberts, Bandwidth sharing : objectives and algorithms, IEEE INFOCOM, 1999.

L. Massoulie, A. Twigg, C. Gkantsidis, and P. Rodriguez, Randomized Decentralized Broadcasting Algorithms, IEEE INFOCOM 2007, 26th IEEE International Conference on Computer Communications, pp.1073-1081, 2007.
DOI : 10.1109/INFCOM.2007.129

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.164.3175

M. Mathis, J. Semke, J. Mahdavi, and T. Ott, The macroscopic behavior of the TCP congestion avoidance algorithm, ACM SIGCOMM Computer Communication Review, vol.27, issue.3, pp.67-82, 1997.
DOI : 10.1145/263932.264023

M. Minoux, Programmation mathématique : théorie et algorithmes, Dunod, vol.1, 1983.

M. Nuttall, A brief survey of systems providing process or object migration facilities, ACM SIGOPS Operating Systems Review, vol.28, issue.4, pp.64-80, 1994.
DOI : 10.1145/191525.191541

J. Padhye, V. Firoiu, D. Towsley, and J. Kurose, Modeling TCP throughput, ACM SIGCOMM Computer Communication Review, vol.28, issue.4, pp.303-314, 1998.
DOI : 10.1145/285243.285291

D. A. Patterson, G. Gibson, and R. H. Katz, A case for redundant arrays of inexpensive disks (RAID), ACM SIGMOD Record, vol.17, issue.3, pp.109-116, 1988.
DOI : 10.1145/971701.50214

D. Pradhan, Fault-Tolerant Computing, Computer, vol.13, issue.3, pp.6-7, 1980.
DOI : 10.1109/MC.1980.1653522

S. Rhea, P. Eaton, D. Geels, H. Weatherspoon, B. Zhao et al., Pond : The OceanStore Prototype, FAST '03 : Proceedings of the 2nd USENIX Conference on File and Storage Technologies, pp.1-14, 2003.

H. G. Rotithor, Taxonomy of dynamic task scheduling schemes in distributed computing systems, IEE Proceedings : Computers and Digital Techniques, pp.1-10, 1994.
DOI : 10.1049/ip-cdt:19949630

A. Rowstron and P. Druschel, Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility, ACM SIGOPS Operating Systems Review, vol.35, issue.5, pp.188-201, 2001.
DOI : 10.1145/502059.502053

L. Rudolph, M. Slivkin-allalouf, and E. Upfal, A simple load balancing scheme for task allocation in parallel machines, Proceedings of the third annual ACM symposium on Parallel algorithms and architectures , SPAA '91, pp.237-245, 1991.
DOI : 10.1145/113379.113401

C. Schindelhauer and G. Schomaker, Weighted distributed hash tables, Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures , SPAA'05, pp.218-227, 2005.
DOI : 10.1145/1073970.1074008

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.414.9353

H. Shachnai and T. Tamir, Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints, Algorithmica, vol.32, issue.4, pp.651-678, 2002.
DOI : 10.1007/s00453-001-0098-3

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.224.1022

H. Shachnai, T. Tamir, and O. Yehezkely, Approximation Schemes for Packing with Item Fragmentation, Theory of Computing Systems, vol.91, issue.11, pp.81-98, 2008.
DOI : 10.1007/s00224-007-9082-x

G. Shao, F. Berman, and R. Wolski, Using effective network views to promote distributed application performance, International Conference on Parallel and Distributed Processing Techniques and Applications, 1999.

A. M. Elizabeth, B. Shriver, A. Hillyer, and . Silberschatz, Performance Analysis of Storage Systems, Performance Evaluation, pp.33-50, 2000.

N. Spring and R. Wolski, Application level scheduling of gene sequence comparison on metacomputers, Proceedings of the 12th international conference on Supercomputing, pp.141-148, 1998.

H. Tang, A. Gulbeden, J. Zhou, W. Strathearn, T. Yang et al., A Self-Organizing Storage Cluster for Parallel Data-Intensive Applications, Proceedings of the ACM/IEEE SC2004 Conference, p.52, 2004.
DOI : 10.1109/SC.2004.9

A. N. Tantawi and D. Towsley, Optimal static load balancing in distributed computer systems, Journal of the ACM, vol.32, issue.2, pp.445-465, 1985.
DOI : 10.1145/3149.3156

Y. C. Tseng, S. Y. Wang, and C. W. Ho, Efficient broadcasting in wormholerouted multicomputers : anetwork-partitioning approach, IEEE TPDS, vol.10, issue.1, pp.44-61, 1999.

R. Van-renesse, Efficient reliable internet storage, Workshop on Dependable Distributed Data Management. Citeseer, 2004.

J. Watts and R. A. Geijn, A PIPELINED BROADCAST FOR MULTIDIMENSIONAL MESHES, Parallel Processing Letters, vol.05, issue.02, pp.281-292, 1995.
DOI : 10.1142/S0129626495000266

S. A. Weil, S. A. Brandt, E. L. Miller, and C. Maltzahn, CRUSH: Controlled, Scalable, Decentralized Placement of Replicated Data, ACM/IEEE SC 2006 Conference (SC'06), p.122, 2006.
DOI : 10.1109/SC.2006.19

A. Sage, S. A. Weil, E. L. Brandt, D. D. Miller, C. Long et al., Ceph : A Scalable, High-Performance Distributed File System, OSDI, pp.307-320, 2006.

A. Sage, S. A. Weil, E. L. Brandt, C. Miller, and . Maltzahn, CRUSH : controlled, scalable, decentralized placement of replicated data, SC '06 : Proceedings of the 2006 ACM/IEEE conference on Supercomputing, p.122, 2006.

M. Wieczorek, R. Prodan, and T. Fahringer, Scheduling of scientific workflows in the ASKALON grid environment, ACM SIGMOD Record, vol.34, issue.3, p.62, 2005.
DOI : 10.1145/1084805.1084816

C. Wu and R. Burns, Achieving Performance Consistency in Heterogeneous Clusters, HPDC '04 : Proceedings of the 13th IEEE International Symposium on High Performance Distributed Computing, pp.140-149, 2004.

Y. Yang and H. Casanova, Multi-round algorithm for scheduling divisible workload applications : analysis and experimental evaluation, 2002.

X. Zhang, J. Liu, B. Li, and Y. S. Yum, CoolStreaming/DONet : A datadriven overlay network for peer-to-peer live media streaming, Proceedings IEEE INFOCOM, 2005.