TY - JOUR A1 - Salem, Farouk A1 - Schintke, Florian A1 - Schütt, Thorsten A1 - Reinefeld, Alexander T1 - Data-flow scheduling for a scalable FLESnet JF - CBM Progress Report 2017 Y1 - 2018 SN - 978-3-9815227-5-4 U6 - https://doi.org/10.15120/GSI-2018-00485 SP - 130 EP - 131 ER - TY - JOUR A1 - Enke, Harry A1 - Partl, Adrian A1 - Reinefeld, Alexander A1 - Schintke, Florian T1 - Handling Big Data in Astronomy and Astrophysics JF - Datenbank-Spektrum Y1 - 2012 UR - http://dx.doi.org/10.1007/s13222-012-0099-1 U6 - https://doi.org/10.1007/s13222-012-0099-1 VL - 12 IS - 3 SP - 173 EP - 181 PB - Springer-Verlag ER - TY - JOUR A1 - Schintke, Florian T1 - XtreemFS & Scalaris JF - Science & Technology Y1 - 2013 IS - 6 SP - 54 EP - 55 PB - Pan European Networks ER - TY - JOUR A1 - Seibert, Felix A1 - Peters, Mathias A1 - Schintke, Florian T1 - Improving I/O Performance Through Colocating Interrelated Input Data and Near-Optimal Load Balancing JF - Proceedings of the IPDPSW; Fourth IEEE International Workshop on High-Performance Big Data, Deep Learning, and Cloud Computing (HPBDC) N2 - Most distributed file systems assign new files to storage servers randomly. While working well in some situations, this does not help to optimize the input performance for most MapReduce computations’ data access patterns. In this work, we consider an access pattern where input files are partitioned into groups of heterogeneous size. Each group is accessed by exactly one process. We design and implement a data placement strategy that places these file groups together on the same storage server. This colocation approach is combined with near-optimal storage load balancing. To do so, we use a classical scheduling approximation algorithm to solve the NP hard group assignment problem. We argue that local processing is not only beneficial because of reduced network traffic, but especially because it imposes an even resource schedule. Our experiments, based on the parallel processing of remote sensing images, reveal an enormous reduction of network traffic and up to 39 % faster input read times. Further, simulations show that our approximate assignments limit storage server imbalances to less than 5 % above the theoretical minimum, in contrast to more than 85 % with random assignment. Y1 - 2018 U6 - https://doi.org/10.1109/IPDPSW.2018.00081 N1 - Best Paper Award VL - 2018 SP - 448 EP - 457 ER - TY - JOUR A1 - Salem, Farouk A1 - Schintke, Florian A1 - Schütt, Thorsten A1 - Reinefeld, Alexander T1 - Improving the throughput of a scalable FLESnet using the Data-Flow Scheduler JF - CBM Progress Report 2018 Y1 - 2019 SN - 978-3-9815227-6-1 U6 - https://doi.org/10.15120/GSI-2019-01018 SP - 149 EP - 150 ER - TY - JOUR A1 - Salem, Farouk A1 - Schintke, Florian A1 - Schütt, Thorsten A1 - Reinefeld, Alexander T1 - Scheduling data streams for low latency and high throughput on a Cray XC40 using Libfabric JF - Concurrency and Computation Practice and Experience Y1 - 2020 U6 - https://doi.org/10.1002/cpe.5563 VL - 32 IS - 20 SP - 1 EP - 14 ER - TY - JOUR A1 - Skrzypczak, Jan A1 - Schintke, Florian A1 - Schütt, Thorsten T1 - RMWPaxos: Fault-Tolerant In-Place Consensus Sequences JF - IEEE Transactions on Parallel and Distributed Systems Y1 - 2020 U6 - https://doi.org/10.1109/TPDS.2020.2981891 SN - 1045-9219 VL - 31 IS - 10 SP - 2392 EP - 2405 ER - TY - JOUR A1 - Skrzypczak, Jan A1 - Schintke, Florian T1 - Towards Log-Less, Fine-Granular State Machine Replication JF - Datenbank Spektrum Y1 - 2020 U6 - https://doi.org/10.1007/s13222-020-00358-4 VL - 20 IS - 3 SP - 231 EP - 241 ER - TY - JOUR A1 - Schütt, Thorsten A1 - Schintke, Florian A1 - Skrzypczak, Jan T1 - Transactions on Red-black and AVL trees in NVRAM JF - arXiv Y1 - 2020 ER - TY - JOUR A1 - Salem, Farouk A1 - Schintke, Florian A1 - Reinefeld, Alexander T1 - Handling Compute-Node Failures in FLESnet JF - CBM Progress Report 2019 Y1 - 2020 SN - 978-3-9815227-8-5 U6 - https://doi.org/10.15120/GSI-2020-00904 SP - 167 EP - 168 ER -