@inproceedings{GholamiSchintke2019, author = {Gholami, Masoud and Schintke, Florian}, title = {Multilevel Checkpoint/Restart for Large Computational Jobs on Distributed Computing Resources}, booktitle = {2019 IEEE 38th Symposium on Reliable Distributed Systems (SRDS)}, doi = {10.1109/SRDS47363.2019.00025}, pages = {143 -- 152}, year = {2019}, language = {en} } @inproceedings{HartungSchintkeSchuett2019, author = {Hartung, Marc and Schintke, Florian and Sch{\"u}tt, Thorsten}, title = {Pinpoint Data Races via Testing and Classification}, booktitle = {2019 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW); 3rd International Workshop on Software Faults (IWSF 2019)}, doi = {10.1109/ISSREW.2019.00100}, pages = {386 -- 393}, 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} } @inproceedings{AllenDramlitschGoodaleetal.2001, author = {Allen, Gabrielle and Dramlitsch, Thomas and Goodale, Tom and Lanfermann, Gerd and Radke, Thomas and Seidel, Edward and Kielmann, Thilo and Verstoep, Kees and Balaton, Zolt{\´a}n and Kacsuk, P{\´e}ter and Szalai, Ferenc and Gehring, J{\"o}rn and Keller, Axel and Streit, Achim and Matyska, Ludek and Ruda, Miroslav and Krenek, Ales and Knipp, Harald and Merzky, Andr{\´e} and Reinefeld, Alexander and Schintke, Florian and Ludwiczak, Bogdan and Nabrzyski, Jarek and Pukacki, Juliusz and Kersken, Hans-Peter and Aloisio, Giovanni and Cafaro, Massimo and Ziegler, Wolfgang and Russell, Michael}, title = {Early experiences with the EGrid testbed}, booktitle = {Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid}, doi = {10.1109/CCGRID.2001.923185}, pages = {130 -- 137}, year = {2001}, language = {en} } @inproceedings{MillerLabartaSchintkeetal.2002, author = {Miller, Barton P. and Labarta, Jes{\´u}s and Schintke, Florian and Simon, Jens}, title = {Performance Evaluation, Analysis and Optimization}, volume = {2400}, booktitle = {Euro-Par 2002 Parallel Processing}, doi = {10.1007/3-540-45706-2_15}, pages = {131 -- 131}, year = {2002}, language = {en} } @inproceedings{IamnitchiTrunfioLedlieetal.2010, author = {Iamnitchi, Adriana and Trunfio, Paolo and Ledlie, Jonathan and Schintke, Florian}, title = {Peer-to-Peer Computing}, volume = {6271}, booktitle = {Euro-Par 2010 - Parallel Processing}, doi = {10.1007/978-3-642-15277-1_42}, pages = {444 -- 445}, year = {2010}, language = {en} } @inproceedings{SchintkeSimonReinefeld2001, author = {Schintke, Florian and Simon, Jens and Reinefeld, Alexander}, title = {A Cache Simulator for Shared Memory Systems}, volume = {2074}, booktitle = {Computational Science - ICCS 2001}, doi = {10.1007/3-540-45718-6_62}, pages = {569 -- 578}, year = {2001}, 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} } @inproceedings{BaerringLopezCancioetal.2003, author = {B{\"a}rring, Olof and Lopez, Maite Barroso and Cancio, German and R{\"o}blitz, Thomas and Schintke, Florian and et al.,}, title = {Towards automation of computing fabrics using tools from the fabric management workpackage of the EU DataGrid project}, booktitle = {Computing in High Energy and Nuclear Physics (CHEP03)}, arxiv = {http://arxiv.org/abs/cs/0305050}, pages = {1 -- 8}, year = {2003}, 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} } @inproceedings{SkrzypczakSchintkeSchuett2019, author = {Skrzypczak, Jan and Schintke, Florian and Sch{\"u}tt, Thorsten}, title = {Linearizable State Machine Replication of State-Based CRDTs without Logs}, booktitle = {Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019}, doi = {10.1145/3293611.3331568}, pages = {455 -- 457}, 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 due to the use of distributed consensus or 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 such as 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} } @inproceedings{HartungSchintke2019, author = {Hartung, Marc and Schintke, Florian}, title = {Learned Clause Minimization in Parallel SAT Solvers}, booktitle = {Pragmatics of SAT 2019}, arxiv = {http://arxiv.org/abs/arXiv:1908.01624v1}, pages = {1 -- 11}, year = {2019}, abstract = {Learned clauses minimization (LCM) let to performance improvements of modern SAT solvers especially in solving hard SAT instances. Despite the success of LCM approaches in sequential solvers, they are not widely incorporated in parallel SAT solvers. In this paper we explore the potential of LCM for parallel SAT solvers by defining multiple LCM approaches based on clause vivification, comparing their runtime in different SAT solvers and discussing reasons for performance gains and losses. Results show that LCM only boosts performance of parallel SAT solvers on a fraction of SAT instances. More commonly applying LCM decreases performance. Only certain LCM approaches are able to improve the overall performance of parallel SAT solvers.}, language = {en} } @inproceedings{SalemSchuettSchintkeetal.2019, author = {Salem, Farouk and Sch{\"u}tt, Thorsten and Schintke, Florian and Reinefeld, Alexander}, title = {Scheduling Data Streams for Low Latency and High Throughput on a Cray XC40 Using Libfabric}, booktitle = {CUG Conference Proceedings}, year = {2019}, abstract = {Achieving efficient many-to-many communication on a given network topology is a challenging task when many data streams from different sources have to be scattered concurrently to many destinations with low variance in arrival times. In such scenarios, it is critical to saturate but not to congest the bisectional bandwidth of the network topology in order to achieve a good aggregate throughput. When there are many concurrent point-to-point connections, the communication pattern needs to be dynamically scheduled in a fine-grained manner to avoid network congestion (links, switches), overload in the node's incoming links, and receive buffer overflow. Motivated by the use case of the Compressed Baryonic Matter experiment (CBM), we study the performance and variance of such communication patterns on a Cray XC40 with different routing schemes and scheduling approaches. We present a distributed Data Flow Scheduler (DFS) that reduces the variance of arrival times from all sources at least 30 times and increases the achieved aggregate bandwidth by up to 50\%.}, 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} } @misc{Schintke2000, author = {Schintke, Florian}, title = {Ermittlung von Programmlaufzeiten anhand von Speicherzugriffen, Microbenchmarks und Simulation vonSpeicherhierarchien}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-6018}, number = {00-33}, year = {2000}, abstract = {\\{\bf Zusammenfassung:} Kostenmodelle dienen der Ermittlung von Programmlaufzeiten, zum Vergleich der Effizienz von Algorithmen und zur Analyse des Verhaltens von Speicherhierarchien. Ein neuartiges Kostenmodell ist das Latency-of-Data-Access (LDA) Modell, das mehrere hierarchische Speicherebenen mit unterschiedlichen Latenzzeiten ber{\"u}{}cksichtigt. In dieser Diplomarbeit wird ein Simulator f{\"u}{}r Speicherhierarchien pr{\"a}{}sentiert, der die Berechnung von Programmausf{\"u}{}hrungszeiten nach dem LDA-Modell erlaubt. Mit Hilfe des Simulators wird die These gepr{\"u}{}ft, da\ss{} mit diesem Modell die Ausf{\"u}{}hrungszeit eines Programms ad{\"a}{}quat abgesch{\"a}{}tzt werden kann. Mit dem Simulator ist es erstmals praktikabel m{\"o}{}glich, Programmausf{\"u}{}hrungszeiten nach dem LDA-Modell zu bestimmen. Der Simulator kann f{\"u}{}r Systeme mit unterschiedlichen Speicherarchitekturen konfiguriert werden und unterst{\"u}{}tzt Mehrprozessorsysteme mit gemeinsamem Speicher (SMP-Systeme) mit verschiedenen Koh{\"a}{}renzprotokollen. Der Simulator kann mit den Ergebnissen von Microbenchmarks konfiguriert werden, die die Architekturparameter einer Speicherhierarchie messen. Die Ergebnisse best{\"a}{}tigen die These nicht nur f{\"u}{}r Einzelprozessorsysteme, sondern auch f{\"u}{}r SMP-Systeme, wo gleichzeitig interagierende Prozessoren gegenseitig ihre Zugriffssequenz auf Zwischenspeicher beeinflussen. Zus{\"a}{}tzlich wurde eine neue Einsatzm{\"o}{}glichkeit des LDA-Modells entwickelt, um die Ausf{\"u}{}hrungszeit von Programmteilen zu bestimmen. Einzelne Zugriffskosten k{\"o}{}nnen einem mehrerer parallel laufender Modelle zugeordnet werden. Dadurch k{\"o}{}nnen Kosten, die Zugriffe auf einzelne Speicherbereiche verursachen, separat bestimmt werden. Diese Profiling-Technik erlaubt Optimierungen an Datenstrukturen und Speicherzugriffsmustern durch pr{\"a}{}zise und gezielte Informationsproduktion.Cost models are used to determine the execution time of programs, to compare the efficiency of algorithms, and to analyse the behaviour of memory hierarchies. The Latency-of-Data-Access (LDA) model that takes into account multiple hierarchical memory levels with different latencies, is a newly proposed, innovative cost model. In this diploma-thesis, a simulator for memory hierarchies is presented that allows the calculation of execution times using the LDA-model. The simulator is used to prove the claim that the execution time of a program can be accurately estimated with the LDA-model. With the simulator, it is for the first time possible to determine the execution time of programs with this model in a practical way. The simulator can be configured for systems with various cache architectures and supports shared memory (SMP) multiprocessor systems with different cache coherence protocols. The simulator can be configured with the results from microbenchmarks which measure the architectural properties of a memory hierarchy. The results confirm the claim not only for single processor systems, but also for SMP systems, where concurrently interacting processors influence each others cache access sequence. Additionally, a new field of usage of the LDA-model was developed to determine execution times of program parts. Single access costs can be assigned to one of several parallel running models. As an example the costs of accesses to different memory areas can be split and determined separately. This profiling technique allows to optimise data structures and memory access patterns of sequential and parallel SMP programs by precise production of information.}, language = {de} } @misc{SchintkeReinefeld2002, author = {Schintke, Florian and Reinefeld, Alexander}, title = {On the Cost of Reliability in Large Data Grids}, doi = {10.1023/B:GRID.0000024086.50333.0d}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-7195}, number = {02-52}, year = {2002}, abstract = {Global grid environments do not only provide massive aggregated computing power but also an unprecedented amount of distributed storage space. Unfortunately, dynamic changes caused by component failures, local decisions, and irregular data updates make it difficult to efficiently use this capacity. In this paper, we address the problem of improving data availability in the presence of unreliable components. We present an analytical model for determining an optimal combination of distributed replica catalogs, catalog sizes, and replica servers. Empirical simulation results confirm the accuracy of our theoretical analysis. Our model captures the characteristics of highly dynamic environments like peer-to-peer networks, but it can also be applied to more centralized, less dynamic grid environments like the European {\em DataGrid}.}, language = {en} } @inproceedings{SchintkeReinefeldHaridietal.2010, author = {Schintke, Florian and Reinefeld, Alexander and Haridi, Seif and Sch{\"u}tt, Thorsten}, title = {Enhanced Paxos Commit for Transactions on DHTs}, booktitle = {CCGRID}, publisher = {IEEE}, doi = {10.1109/CCGRID.2010.41}, pages = {448 -- 454}, year = {2010}, language = {en} } @phdthesis{Schintke2010, author = {Schintke, Florian}, title = {Management verteilter Daten in Grid- und Peer-to-Peer-Systemen}, year = {2010}, language = {en} } @inproceedings{SchuettReinefeldSchintkeetal.2009, author = {Sch{\"u}tt, Thorsten and Reinefeld, Alexander and Schintke, Florian and Hennig, C.}, title = {Self-Adaptation in Large-Scale Systems: A Study on Structured Overlays Across Multiple Datacenters}, booktitle = {Architectures and Languages for Self-Managing Distributed Systems (SelfMan@SASO)}, doi = {10.1109/SASOW.2010.65}, year = {2009}, language = {en} } @inproceedings{SchuettMoserPlantikowetal.2008, author = {Sch{\"u}tt, Thorsten and Moser, Monika and Plantikow, Stefan and Schintke, Florian and Reinefeld, Alexander}, title = {A Transactional Scalable Distributed Data Store}, booktitle = {1st IEEE International Scalable Computing Challenge, co-located with CCGrid'08}, year = {2008}, language = {en} } @misc{AndrzejakReinefeldSchintkeetal.2008, author = {Andrzejak, Artur and Reinefeld, Alexander and Schintke, Florian and Sch{\"u}tt, Thorsten and Mastroianni, Carlo and Fragopoulou, Paraskevi and Kondo, Derrick and Malecot, Paul and Cosmin Silaghi, Gheorghe and Moura Silva, Luis and Trunfio, Paolo and Zeinalipour-Yazti, Demetris and Zimeo, Eugenio}, title = {Grid Architectural Issues: State-of-the-art and Future Trends}, number = {WHP-0004}, publisher = {Institute on Architectural Issues: Scalability, Dependability, Adaptability, CoreGRID - Network of Excellence}, year = {2008}, language = {en} }