TY - CHAP A1 - Gholami, Masoud A1 - Schintke, Florian T1 - Multilevel Checkpoint/Restart for Large Computational Jobs on Distributed Computing Resources T2 - 2019 IEEE 38th Symposium on Reliable Distributed Systems (SRDS) Y1 - 2019 U6 - https://doi.org/10.1109/SRDS47363.2019.00025 SP - 143 EP - 152 ER - TY - CHAP A1 - Hartung, Marc A1 - Schintke, Florian A1 - Schütt, Thorsten T1 - Pinpoint Data Races via Testing and Classification T2 - 2019 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW); 3rd International Workshop on Software Faults (IWSF 2019) Y1 - 2019 U6 - https://doi.org/10.1109/ISSREW.2019.00100 SP - 386 EP - 393 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 - CHAP A1 - Allen, Gabrielle A1 - Dramlitsch, Thomas A1 - Goodale, Tom A1 - Lanfermann, Gerd A1 - Radke, Thomas A1 - Seidel, Edward A1 - Kielmann, Thilo A1 - Verstoep, Kees A1 - Balaton, Zoltán A1 - Kacsuk, Péter A1 - Szalai, Ferenc A1 - Gehring, Jörn A1 - Keller, Axel A1 - Streit, Achim A1 - Matyska, Ludek A1 - Ruda, Miroslav A1 - Krenek, Ales A1 - Knipp, Harald A1 - Merzky, André A1 - Reinefeld, Alexander A1 - Schintke, Florian A1 - Ludwiczak, Bogdan A1 - Nabrzyski, Jarek A1 - Pukacki, Juliusz A1 - Kersken, Hans-Peter A1 - Aloisio, Giovanni A1 - Cafaro, Massimo A1 - Ziegler, Wolfgang A1 - Russell, Michael T1 - Early experiences with the EGrid testbed T2 - Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid Y1 - 2001 U6 - https://doi.org/10.1109/CCGRID.2001.923185 SP - 130 EP - 137 ER - TY - CHAP A1 - Miller, Barton P. A1 - Labarta, Jesús A1 - Schintke, Florian A1 - Simon, Jens T1 - Performance Evaluation, Analysis and Optimization T2 - Euro-Par 2002 Parallel Processing Y1 - 2002 U6 - https://doi.org/10.1007/3-540-45706-2_15 VL - 2400 SP - 131 EP - 131 ER - TY - CHAP A1 - Iamnitchi, Adriana A1 - Trunfio, Paolo A1 - Ledlie, Jonathan A1 - Schintke, Florian T1 - Peer-to-Peer Computing T2 - Euro-Par 2010 - Parallel Processing Y1 - 2010 U6 - https://doi.org/10.1007/978-3-642-15277-1_42 VL - 6271 SP - 444 EP - 445 ER - TY - CHAP A1 - Schintke, Florian A1 - Simon, Jens A1 - Reinefeld, Alexander T1 - A Cache Simulator for Shared Memory Systems T2 - Computational Science - ICCS 2001 Y1 - 2001 U6 - https://doi.org/10.1007/3-540-45718-6_62 VL - 2074 SP - 569 EP - 578 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 - CHAP A1 - Bärring, Olof A1 - Lopez, Maite Barroso A1 - Cancio, German A1 - Röblitz, Thomas A1 - Schintke, Florian A1 - et al., T1 - Towards automation of computing fabrics using tools from the fabric management workpackage of the EU DataGrid project T2 - Computing in High Energy and Nuclear Physics (CHEP03) Y1 - 2003 SP - 1 EP - 8 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 - TY - CHAP A1 - Skrzypczak, Jan A1 - Schintke, Florian A1 - Schütt, Thorsten T1 - Linearizable State Machine Replication of State-Based CRDTs without Logs T2 - Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019 N2 - 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. Y1 - 2019 U6 - https://doi.org/10.1145/3293611.3331568 SP - 455 EP - 457 ER - TY - CHAP A1 - Hartung, Marc A1 - Schintke, Florian T1 - Learned Clause Minimization in Parallel SAT Solvers T2 - Pragmatics of SAT 2019 N2 - 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. Y1 - 2019 UR - http://www.pragmaticsofsat.org/2019/ SP - 1 EP - 11 ER - TY - CHAP A1 - Salem, Farouk A1 - Schütt, Thorsten A1 - Schintke, Florian A1 - Reinefeld, Alexander T1 - Scheduling Data Streams for Low Latency and High Throughput on a Cray XC40 Using Libfabric T2 - CUG Conference Proceedings N2 - 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%. Y1 - 2019 ER - TY - JOUR A1 - Skrzypczak, Jan A1 - Schintke, Florian A1 - Schütt, Thorsten T1 - Linearizable State Machine Replication of State-Based CRDTs without Logs JF - arXiv N2 - 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. Y1 - 2019 ER - TY - GEN A1 - Schintke, Florian T1 - Ermittlung von Programmlaufzeiten anhand von Speicherzugriffen, Microbenchmarks und Simulation vonSpeicherhierarchien N2 - \\{\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ü{}cksichtigt. In dieser Diplomarbeit wird ein Simulator fü{}r Speicherhierarchien prä{}sentiert, der die Berechnung von Programmausfü{}hrungszeiten nach dem LDA-Modell erlaubt. Mit Hilfe des Simulators wird die These geprü{}ft, da\ss{} mit diesem Modell die Ausfü{}hrungszeit eines Programms adä{}quat abgeschä{}tzt werden kann. Mit dem Simulator ist es erstmals praktikabel mö{}glich, Programmausfü{}hrungszeiten nach dem LDA-Modell zu bestimmen. Der Simulator kann fü{}r Systeme mit unterschiedlichen Speicherarchitekturen konfiguriert werden und unterstü{}tzt Mehrprozessorsysteme mit gemeinsamem Speicher (SMP-Systeme) mit verschiedenen Kohä{}renzprotokollen. Der Simulator kann mit den Ergebnissen von Microbenchmarks konfiguriert werden, die die Architekturparameter einer Speicherhierarchie messen. Die Ergebnisse bestä{}tigen die These nicht nur fü{}r Einzelprozessorsysteme, sondern auch fü{}r SMP-Systeme, wo gleichzeitig interagierende Prozessoren gegenseitig ihre Zugriffssequenz auf Zwischenspeicher beeinflussen. Zusä{}tzlich wurde eine neue Einsatzmö{}glichkeit des LDA-Modells entwickelt, um die Ausfü{}hrungszeit von Programmteilen zu bestimmen. Einzelne Zugriffskosten kö{}nnen einem mehrerer parallel laufender Modelle zugeordnet werden. Dadurch kö{}nnen Kosten, die Zugriffe auf einzelne Speicherbereiche verursachen, separat bestimmt werden. Diese Profiling-Technik erlaubt Optimierungen an Datenstrukturen und Speicherzugriffsmustern durch prä{}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. T3 - ZIB-Report - 00-33 KW - Cache-Simulator KW - Microbenchmarks KW - SMP-System KW - Kostenmodell KW - Speicherhierarchie Y1 - 2000 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-6018 ER - TY - GEN A1 - Schintke, Florian A1 - Reinefeld, Alexander T1 - On the Cost of Reliability in Large Data Grids N2 - 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}. T3 - ZIB-Report - 02-52 KW - replication KW - availability KW - reliability KW - distributed catalog KW - data grid Y1 - 2002 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-7195 ER - TY - CHAP A1 - Schintke, Florian A1 - Reinefeld, Alexander A1 - Haridi, Seif A1 - Schütt, Thorsten T1 - Enhanced Paxos Commit for Transactions on DHTs T2 - CCGRID Y1 - 2010 U6 - https://doi.org/10.1109/CCGRID.2010.41 SP - 448 EP - 454 PB - IEEE ER - TY - THES A1 - Schintke, Florian T1 - Management verteilter Daten in Grid- und Peer-to-Peer-Systemen Y1 - 2010 UR - http://www.dr.hut-verlag.de/978-3-86853-358-3.html ER - TY - CHAP A1 - Schütt, Thorsten A1 - Reinefeld, Alexander A1 - Schintke, Florian A1 - Hennig, C. T1 - Self-Adaptation in Large-Scale Systems: A Study on Structured Overlays Across Multiple Datacenters T2 - Architectures and Languages for Self-Managing Distributed Systems (SelfMan@SASO) Y1 - 2009 U6 - https://doi.org/10.1109/SASOW.2010.65 ER - TY - CHAP A1 - Schütt, Thorsten A1 - Moser, Monika A1 - Plantikow, Stefan A1 - Schintke, Florian A1 - Reinefeld, Alexander T1 - A Transactional Scalable Distributed Data Store T2 - 1st IEEE International Scalable Computing Challenge, co-located with CCGrid’08 Y1 - 2008 ER - TY - GEN A1 - Andrzejak, Artur A1 - Reinefeld, Alexander A1 - Schintke, Florian A1 - Schütt, Thorsten A1 - Mastroianni, Carlo A1 - Fragopoulou, Paraskevi A1 - Kondo, Derrick A1 - Malecot, Paul A1 - Cosmin Silaghi, Gheorghe A1 - Moura Silva, Luis A1 - Trunfio, Paolo A1 - Zeinalipour-Yazti, Demetris A1 - Zimeo, Eugenio T1 - Grid Architectural Issues: State-of-the-art and Future Trends Y1 - 2008 UR - http://coregrid.ercim.eu//mambo/images/stories/WhitePapers/whp-0004.pdf IS - WHP-0004 PB - Institute on Architectural Issues: Scalability, Dependability, Adaptability, CoreGRID - Network of Excellence ER -