, Scheduling Frameworks in Clusters, IEEE/ACM International Symposium on Cluster, Cloud, and Grid Computing, pp.592-595, 2016.

S. A. Jyothi, C. Curino, I. Menache, S. M. Narayanamurthy, A. Tumanov et al., Morpheus: Towards Automated SLOs for Enterprise Clusters, USENIX Symposium on Operating Systems Design and Implementation, pp.117-134, 2016.

S. S. Vadhiyar and J. J. Dongarra, SRS: A Framework for Developing Malleable and Migratable Parallel Applications For Distributed Systems, Parallel Processing Letters, vol.13, issue.2, pp.291-312, 2003.

L. V. Kale, S. Kumar, and J. Desouza, A Malleable-Job System for Timeshared Parallel Machines, IEEE/ACM International Symposium on Cluster Computing and the Grid

J. Buisson, F. André, and J. Pazat, A Framework for Dynamic Adaptation of Parallel Components, International Conference Parallel Computing, pp.1-8, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00498836

J. Ousterhout, P. Agrawal, D. Erickson, C. Kozyrakis, J. Leverich et al., The Case for RAMClouds: Scalable High-Performance Storage Entirely in DRAM, ACM SIGOPS Operating Systems Review, vol.43, issue.4, pp.92-105, 2010.

N. Cheriere and G. Antoniu, How Fast Can One Scale Down a Distributed File System?, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01644928

M. Wilde, I. Foster, K. Iskra, P. Beckman, Z. Zhang et al., Parallel Scripting for Applications at the PetaScale and Beyond, vol.10, pp.50-60, 2009.

Q. Zheng, K. Ren, G. Gibson, B. W. Settlemyer, and G. Grider, DeltaFS: Exascale File Systems Scale Better Without Dedicated Servers, Parallel Data Storage Workshop, pp.1-6, 2015.

M. Dorier, P. Carns, K. Harms, R. Latham, R. Ross et al., 3rd Joint International Workshop on Parallel Data Storage & Data Intensive Scalable Computing Systems (PDSW-DISCS), 2018.

S. Prabhakaran, M. Neumann, S. Rinke, F. Wolf, A. Gupta et al., A Batch System with Efficient Adaptive Scheduling for Malleable and Evolving Applications, International Parallel and Distributed Processing Symposium, pp.429-438, 2015.

K. Jansen and L. Porkolab, Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks, Algorithmica, vol.32, pp.507-520, 2002.

G. Mounie, C. Rapine, and D. Trystram, Efficient Approximation Algorithms for Scheduling Malleable Tasks, ACM Symposium on Parallel Algorithms and Architectures, vol.3, pp.23-32, 1999.
URL : https://hal.archives-ouvertes.fr/hal-00001525

B. Trushkowsky, P. Bodik, A. Fox, M. J. Franklin, M. I. Jordan et al., The SCADS Director: Scaling a Distributed Storage System under Stringent Performance Requirements, USENIX Conference on File and Storage Technologies, pp.163-176, 2011.

H. C. Lim, S. Babu, and J. S. Chase, Automated Control for Elastic Storage, International Conference on Autonomic Computing, pp.1-10, 2010.

H. Amur, J. Cipar, V. Gupta, G. R. Ganger, M. A. Kozuch et al., Robust and Flexible Power-Proportional Storage, ACM Symposium on Cloud Computing, pp.217-228, 2010.

E. Thereska, A. Donnelly, and D. Narayanan, Sierra: Practical Power-Proportionality for Data center Storage, p.169, 2011.

L. Xu, J. Cipar, E. Krevat, A. Tumanov, N. Gupta et al., SpringFS : Bridging Agility and Performance in Elastic Distributed Storage, USENIX Conference on File and Storage Technologies, pp.243-255, 2014.

A. Miranda and T. Cortes, CRAID: Online RAID Upgrades Using Dynamic Hot Data Reorganization, vol.14, pp.133-146, 2014.

K. Shvachko, H. Kuang, S. Radia, and R. Chansler, The Hadoop Distributed File System, IEEE Symposium on Mass Storage Systems and Technologies, pp.1-10, 2010.

P. B. Godfrey and I. Stoica, Heterogeneity and Load Balance in Distributed Hash Tables, INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, pp.596-606, 2005.

S. A. Weil, S. A. Brandt, E. L. Miller, D. D. Long, and C. Maltzahn, Ceph: A scalable, high-performance distributed file system, Proceedings of the 7th symposium on Operating systems design and implementation, USENIX Association, pp.307-320, 2006.

P. Schwan, Lustre: Building a file system for 1000-node clusters, Proceedings of the 2003 Linux symposium, pp.380-386, 2003.

S. Balakrishnan, R. Black, A. Donnelly, P. England, A. Glass et al., Pelican: A Building Block for Exascale Cold Data Storage, pp.351-365, 2014.

H. Li, A. Ghodsi, M. Zaharia, S. Shenker, I. Stoica et al., Memory Speed Storage for Cluster Computing Frameworks, ACM Symposium on Cloud Computing, pp.1-15, 2014.

M. Zaharia, M. Chowdhury, M. J. Franklin, S. Shenker, and I. Stoica, Spark: Cluster Computing with Working Sets, vol.10, p.95, 2010.

Y. Dodge and D. Commenges, The Oxford dictionary of statistical terms, 2006.

D. Balouek, A. Amarie, G. Charrier, F. Desprez, E. Jeannot et al.,

. Testbed, Cloud Computing and Services Science, vol.367, pp.3-20, 2013.

N. Cheriere, M. Dorier, and G. Antoniu, Pufferbench: Evaluating and Optimizing Malleability of Distributed Storage, 3rd IEEE/ACM International Workshop on Parallel Data Storage & Data Intensive Scalable Computing Systems (PDSW-DISCS), pp.35-44, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01892713

S. Ghemawat, H. Gobioff, and S. Leung, The Google File System, ACM SIGOPS Operating Systems Review, vol.37, issue.5, p.29, 2003.

J. Kreps, N. Narkhede, and J. Rao, Kafka: A distributed messaging system for log processing, Proceedings of the NetDB, pp.1-7, 2011.

. Pufferscale,

N. Cheriere, Towards Malleable Distributed Storage Systems: from Models to Practice, ENS Rennes, 2019.
URL : https://hal.archives-ouvertes.fr/tel-02376032

X. C. Cray and . Series,

, NVMe SSD 960 PRO/EVO, vol.1

P. Maechling, E. Deelman, L. Zhao, R. Graves, G. Mehta et al., Others, SCEC CyberShake Workflow -Automating Probabilistic Seismic Hazard Analysis Calculations, in: Workflows for e-Science, pp.143-163, 2007.

G. Juve, A. Chervenak, E. Deelman, S. Bharathi, G. Mehta et al., Characterizing and Profiling Scientific Workflows, vol.29, pp.682-692, 2013.

N. Cheriere, M. Dorier, and G. Antoniu, Is it Worth Relaxing Fault Tolerance to Speed Up Decommission in Distributed Storage Systems?, p.19
URL : https://hal.archives-ouvertes.fr/hal-02116727

, IEEE/ACM International Symposium on Cluster Computing and the Grid (CC-Grid), 2019.

, nb, the number of sets of r distinct nodes containing the r ? k old nodes of A

, D k A , the amount of data from a set of r distinct nodes that was assigned to exactly k new nodes by Algorithm 1

, remain , the proportion of that data that remains on the r ? k old nodes of A