@article{SalemSchintkeSchuettetal.2018, author = {Salem, Farouk and Schintke, Florian and Sch{\"u}tt, Thorsten and Reinefeld, Alexander}, title = {Data-flow scheduling for a scalable FLESnet}, journal = {CBM Progress Report 2017}, isbn = {978-3-9815227-5-4}, doi = {10.15120/GSI-2018-00485}, pages = {130 -- 131}, year = {2018}, language = {en} } @article{EnkePartlReinefeldetal.2012, author = {Enke, Harry and Partl, Adrian and Reinefeld, Alexander and Schintke, Florian}, title = {Handling Big Data in Astronomy and Astrophysics}, volume = {12}, journal = {Datenbank-Spektrum}, number = {3}, publisher = {Springer-Verlag}, doi = {10.1007/s13222-012-0099-1}, pages = {173 -- 181}, year = {2012}, language = {en} } @article{Schintke2013, author = {Schintke, Florian}, title = {XtreemFS \& Scalaris}, journal = {Science \& Technology}, number = {6}, publisher = {Pan European Networks}, pages = {54 -- 55}, year = {2013}, language = {en} } @article{SeibertPetersSchintke2018, author = {Seibert, Felix and Peters, Mathias and Schintke, Florian}, title = {Improving I/O Performance Through Colocating Interrelated Input Data and Near-Optimal Load Balancing}, volume = {2018}, journal = {Proceedings of the IPDPSW; Fourth IEEE International Workshop on High-Performance Big Data, Deep Learning, and Cloud Computing (HPBDC)}, doi = {10.1109/IPDPSW.2018.00081}, pages = {448 -- 457}, year = {2018}, abstract = {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.}, language = {en} } @article{SalemSchintkeSchuettetal.2019, author = {Salem, Farouk and Schintke, Florian and Sch{\"u}tt, Thorsten and Reinefeld, Alexander}, title = {Improving the throughput of a scalable FLESnet using the Data-Flow Scheduler}, journal = {CBM Progress Report 2018}, isbn = {978-3-9815227-6-1}, doi = {10.15120/GSI-2019-01018}, pages = {149 -- 150}, year = {2019}, language = {en} } @article{SalemSchintkeSchuettetal.2020, author = {Salem, Farouk and Schintke, Florian and Sch{\"u}tt, Thorsten and Reinefeld, Alexander}, title = {Scheduling data streams for low latency and high throughput on a Cray XC40 using Libfabric}, volume = {32}, journal = {Concurrency and Computation Practice and Experience}, number = {20}, doi = {10.1002/cpe.5563}, pages = {1 -- 14}, year = {2020}, language = {en} } @article{SkrzypczakSchintkeSchuett2020, author = {Skrzypczak, Jan and Schintke, Florian and Sch{\"u}tt, Thorsten}, title = {RMWPaxos: Fault-Tolerant In-Place Consensus Sequences}, volume = {31}, journal = {IEEE Transactions on Parallel and Distributed Systems}, number = {10}, issn = {1045-9219}, arxiv = {http://arxiv.org/abs/2001.03362}, doi = {10.1109/TPDS.2020.2981891}, pages = {2392 -- 2405}, year = {2020}, language = {en} } @article{SkrzypczakSchintke2020, author = {Skrzypczak, Jan and Schintke, Florian}, title = {Towards Log-Less, Fine-Granular State Machine Replication}, volume = {20}, journal = {Datenbank Spektrum}, number = {3}, doi = {10.1007/s13222-020-00358-4}, pages = {231 -- 241}, year = {2020}, language = {en} } @article{SchuettSchintkeSkrzypczak2020, author = {Sch{\"u}tt, Thorsten and Schintke, Florian and Skrzypczak, Jan}, title = {Transactions on Red-black and AVL trees in NVRAM}, journal = {arXiv}, arxiv = {http://arxiv.org/abs/2006.16284}, year = {2020}, language = {en} } @article{SalemSchintkeReinefeld2020, author = {Salem, Farouk and Schintke, Florian and Reinefeld, Alexander}, title = {Handling Compute-Node Failures in FLESnet}, journal = {CBM Progress Report 2019}, isbn = {978-3-9815227-8-5}, doi = {10.15120/GSI-2020-00904}, pages = {167 -- 168}, year = {2020}, language = {en} } @article{SkrzypczakSchintkeSchuett2019, author = {Skrzypczak, Jan and Schintke, Florian and Sch{\"u}tt, Thorsten}, title = {Linearizable State Machine Replication of State-Based CRDTs without Logs}, journal = {arXiv}, arxiv = {http://arxiv.org/abs/1905.08733v1}, year = {2019}, abstract = {General solutions of state machine replication have to ensure that all replicas apply the same commands in the same order, even in the presence of failures. Such strict ordering incurs high synchronization costs caused by distributed consensus or by the use of a leader. This paper presents a protocol for linearizable state machine replication of conflict-free replicated data types (CRDTs) that neither requires consensus nor a leader. By leveraging the properties of state-based CRDTs - in particular the monotonic growth of a join semilattice - synchronization overhead is greatly reduced. In addition, updates just need a single round trip and modify the state `in-place' without the need for a log. Furthermore, the message size overhead for coordination consists of a single counter per message. While reads in the presence of concurrent updates are not wait-free without a coordinator, we show that more than 97\% of reads can be handled in one or two round trips under highly concurrent accesses. Our protocol achieves high throughput without auxiliary processes like command log management or leader election. It is well suited for all practical scenarios that need linearizable access on CRDT data on a fine-granular scale.}, language = {en} } @article{SchuettSchintkeReinefeld2008, author = {Sch{\"u}tt, Thorsten and Schintke, Florian and Reinefeld, Alexander}, title = {Range Queries on structured overlay networks}, volume = {31}, journal = {Computer Communications}, number = {2}, publisher = {Elsevier}, doi = {10.1016/j.comcom.2007.08.027}, pages = {280 -- 291}, year = {2008}, language = {en} } @article{RoeblitzSchintkeReinefeldetal.2004, author = {R{\"o}blitz, Thomas and Schintke, Florian and Reinefeld, Alexander and B{\"a}rring, Olof and Lopez, Maite Barroso and Cancio, German and Chapeland, Sylvain and Chouikh, Karim and Cons, Lionel and Poznanski, Piotr and Defert, Philippe and Iven, Jan and Kleinwort, Thorsten and Panzer-Steindel, Bernd and Polok, Jaroslaw and Rafflin, Catherine and Silverman, Alan and Smith, Tim and van Eldik, Jan and Front, David and Biasotto, Massimo and Aiftimiei, Cristina and Ferro, Enrico and Maron, Gaetano and Chierici, Andrea and dell'Agnello, Luca and Serra, Marco and Michelotto, Michele and Hess, Lord and Lindenstruth, Volker and Pister, Frank and Steinbeck, Timm and Groep, David and Steenbakkers, Martijn and Koeroo, Oscar and de Cerff, Wim and Venekamp, Gerben and Anderson, Paul and Colles, Tim and Holt, Alexander and Scobie, Alastair and George, Michael and Washbrook, Andrew and Leiva, Rafael}, title = {Autonomic Management of Large Clusters and Their Integration into the Grid}, volume = {2}, journal = {J. Grid Comput.}, number = {3}, doi = {10.1007/s10723-004-7647-3}, pages = {247 -- 260}, year = {2004}, language = {en} } @article{ReinefeldSchintke2004, author = {Reinefeld, Alexander and Schintke, Florian}, title = {Grid Services: Web Services zur Nutzung verteilter Ressourcen}, volume = {27}, journal = {Informatik Spektrum}, number = {2}, doi = {10.1007/s00287-004-0379-8}, pages = {129 -- 135}, year = {2004}, language = {en} } @article{ReinefeldStuebenSchintkeetal.2002, author = {Reinefeld, Alexander and St{\"u}ben, Hinnerk and Schintke, Florian and Din, George}, title = {GuiGen: a toolset for creating customized interfaces for Grid user communities}, volume = {18}, journal = {Future Generation Comp. Syst.}, number = {8}, doi = {10.1016/S0167-739X(02)00086-9}, pages = {1075 -- 1084}, year = {2002}, language = {en} } @article{WendlerSchintke2005, author = {Wendler, Jan and Schintke, Florian}, title = {Executing and observing CFD applications on the Grid}, volume = {21}, journal = {Future Generation Computer Systems the International Journal of Grid Computing: Theory, Methods and Applications}, number = {1}, publisher = {Elsevier Science Publishers}, doi = {10.1016/j.future.2004.09.026}, pages = {11 -- 18}, year = {2005}, language = {en} } @article{AllenDavisGoodaleetal.2005, author = {Allen, Gabrielle and Davis, K. and Goodale, Tom and Hutanu, Andrei and Kaiser, Hartmut and Kielmann, Thilo and Merzky, Andre and Nieuwpoort, R. and Reinefeld, Alexander and Schintke, Florian and Sch{\"u}tt, Thorsten and Seidel, Edward and Ullmer, Brygg}, title = {The Grid Application Toolkit: Toward Generic and Easy Appliction Programming Interfaces for the Grid}, volume = {93}, journal = {Procceedings of the IEEE}, number = {3}, publisher = {IEEE Computer Society Press}, doi = {10.1109/JPROC.2004.842755}, pages = {534 -- 550}, year = {2005}, language = {en} } @article{RoeblitzSchintkeReinefeld2006, author = {R{\"o}blitz, Thomas and Schintke, Florian and Reinefeld, Alexander}, title = {Resource reservations with fuzzy requests}, volume = {18}, journal = {Concurrency and Computation: Practice and Experience}, number = {13}, doi = {10.1002/cpe.1023}, pages = {1681 -- 1703}, year = {2006}, language = {en} } @article{ReinefeldSchintke2003, author = {Reinefeld, Alexander and Schintke, Florian}, title = {Grid Computing in Deutschland}, journal = {Spektrum der Wissenschaft}, publisher = {Spektrum der Wissenschaft Verlagsgesellschaft, Heidelberg}, pages = {72 -- 73}, year = {2003}, language = {en} } @article{SchintkeReinefeld2003, author = {Schintke, Florian and Reinefeld, Alexander}, title = {Modeling Replica Availability in Large Data Grids}, volume = {1}, journal = {J. Grid Computing}, number = {2}, doi = {10.1023/B:GRID.0000024086.50333.0d}, pages = {219 -- 227}, year = {2003}, language = {en} }