TY - GEN A1 - Schintke, Florian A1 - Reinefeld, Alexander A1 - Haridi, Seif A1 - Schütt, Thorsten T1 - Enhanced Paxos Commit for Transactions on DHTs N2 - Key/value stores which are built on structured overlay networks often lack support for atomic transactions and strong data consistency among replicas. This is unfortunate, because consistency guarantees and transactions would allow a wide range of additional application domains to benefit from the inherent scalability and fault-tolerance of DHTs. The Scalaris key/value store supports strong data consistency and atomic transactions. It uses an enhanced Paxos Commit protocol with only four communication steps rather than six. This improvement was possible by exploiting information from the replica distribution in the DHT. Scalaris enables implementation of more reliable and scalable infrastructure for collaborative Web services that require strong consistency and atomic changes across multiple items. T3 - ZIB-Report - 09-28 KW - Paxos KW - Transaktionen KW - DHT KW - strenge Konsistenz KW - Paxos KW - transactions KW - DHT KW - strong consistency Y1 - 2009 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-11448 SN - 1438-0064 ER - TY - THES A1 - Schintke, Florian T1 - Ermittlung von Programmlaufzeiten anhand von Speicherzugriffen, Microbenchmarks und Simulation von Speicherhierarchien N2 - 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ß 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 Zugriffsse-quenz 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. N2 - 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. Y1 - 2000 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-10063 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 - Kindermann, S. A1 - Schintke, Florian A1 - Fritzsch, B. T1 - A Collaborative Data Management Infrastructure for Climate Data Analysis T2 - Geophysical Research Abstracts Y1 - 2012 UR - http://meetingorganizer.copernicus.org/EGU2012/EGU2012-10569.pdf U6 - https://doi.org/10013/epic.39635.d001 VL - 14, EGU2012-10569 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 - 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 - CHAP A1 - Schütt, Thorsten A1 - Reinefeld, Alexander A1 - Schintke, Florian A1 - Hoffmann, Marie T1 - Gossip-based Topology Inference for Efficient Overlay Mapping on Data Centers T2 - Peer-to-Peer Computing Y1 - 2009 U6 - https://doi.org/10.1109/P2P.2009.5284553 SP - 147 EP - 150 ER - TY - CHAP A1 - Reinefeld, Alexander A1 - Schintke, Florian A1 - Schütt, Thorsten A1 - Haridi, Seif ED - Tselentis, G. ED - Domingue, J. ED - Galis, A. ED - Gavras, A. ED - Hausheer, D. ED - Krco, S. ED - Lotz, V. ED - Zahariadis, T. T1 - A Scalable, Transactional Data Store for Future Internet Services T2 - Towards the Future Internet - A European Research Perspective Y1 - 2009 U6 - https://doi.org/10.3233/978-1-60750-007-0-148 SP - 148 EP - 159 PB - IOS Press ER - TY - CHAP A1 - Plantikow, Stefan A1 - Reinefeld, Alexander A1 - Schintke, Florian ED - Danelutto, Marco ED - Fragopoulou, Paraskevi ED - Getov, Vladimir T1 - Transactions and Concurrency Control for Peer-to-Peer-Wikis: An Evaluation T2 - Making Grids Work Y1 - 2008 U6 - https://doi.org/10.1007/978-0-387-78448-9_27 SP - 337 EP - 349 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 - TY - JOUR A1 - Schütt, Thorsten A1 - Schintke, Florian A1 - Reinefeld, Alexander T1 - Range Queries on structured overlay networks JF - Computer Communications Y1 - 2008 U6 - https://doi.org/10.1016/j.comcom.2007.08.027 VL - 31 IS - 2 SP - 280 EP - 291 PB - Elsevier ER - TY - CHAP A1 - Schütt, Thorsten A1 - Schintke, Florian A1 - Reinefeld, Alexander T1 - Scalaris: Reliable Transactional P2P Key/Value T2 - ERLANG '08: Proceedings of the 7th ACM SIGPLAN workshop on ERLANG Y1 - 2008 U6 - https://doi.org/10.1145/1411273.1411280 SP - 41 EP - 47 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 - CHAP A1 - Enke, Harry A1 - Fiedler, Norman A1 - Fischer, Thomas A1 - Gnadt, Timo A1 - Ketzan, Erik A1 - Ludwig, Jens A1 - Rathmann, Torsten A1 - Stöckle, Gabriel A1 - Schintke, Florian ED - Enke, Harry ED - Ludwig, Jens T1 - Leitfaden zum Forschungsdaten-Management T2 - Leitfaden zum Forschungsdaten-Management Y1 - 2013 PB - Verlag Werner Hülsbusch, Glückstadt ER - TY - JOUR A1 - Reinefeld, Alexander A1 - Stüben, Hinnerk A1 - Schintke, Florian A1 - Din, George T1 - GuiGen: a toolset for creating customized interfaces for Grid user communities JF - Future Generation Comp. Syst. Y1 - 2002 U6 - https://doi.org/10.1016/S0167-739X(02)00086-9 VL - 18 IS - 8 SP - 1075 EP - 1084 ER - TY - CHAP A1 - Fajerski, J. A1 - Noack, Matthias A1 - Reinefeld, Alexander A1 - Schintke, Florian A1 - Schütt, Thorsten A1 - Steinke, Thomas T1 - Fast In-Memory Checkpointing with POSIX API for Legacy Exascale-Applications T2 - SPPEXA Symposium 2016 Y1 - 2016 U6 - https://doi.org/10.1007/978-3-319-40528-5_19 ER - TY - JOUR A1 - Ablyazimov, T. A1 - Abuhoza, A. A1 - Adak, R. P. A1 - Reinefeld, Alexander A1 - Schintke, Florian A1 - et al., T1 - Challenges in QCD matter physics – The scientific programme of the Compressed Baryonic Matter experiment at FAIR JF - The European Physical Journal A Y1 - 2017 U6 - https://doi.org/10.1140/epja/i2017-12248-y N1 - This paper has 587 authors. For the complete list of authors use the DOI, please. ER - TY - JOUR A1 - Allen, Gabrielle A1 - Davis, K. A1 - Goodale, Tom A1 - Hutanu, Andrei A1 - Kaiser, Hartmut A1 - Kielmann, Thilo A1 - Merzky, Andre A1 - Nieuwpoort, R. A1 - Reinefeld, Alexander A1 - Schintke, Florian A1 - Schütt, Thorsten A1 - Seidel, Edward A1 - Ullmer, Brygg T1 - The Grid Application Toolkit: Toward Generic and Easy Appliction Programming Interfaces for the Grid JF - Procceedings of the IEEE Y1 - 2005 U6 - https://doi.org/10.1109/JPROC.2004.842755 VL - 93 IS - 3 SP - 534 EP - 550 PB - IEEE Computer Society Press ER - TY - CHAP A1 - Schintke, Florian ED - Cosnard, Michel ED - Getov, Vladimir ED - Laforenza, Domenico ED - Reinefeld, Alexander T1 - The ZIB distributed data management system T2 - Future Generation Grids Y1 - 2005 UR - http://drops.dagstuhl.de/opus/volltexte/2005/26 IS - 04451 SP - 20 PB - Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany CY - Dagstuhl, Germany ER - TY - JOUR A1 - Röblitz, Thomas A1 - Schintke, Florian A1 - Reinefeld, Alexander A1 - Bärring, Olof A1 - Lopez, Maite Barroso A1 - Cancio, German A1 - Chapeland, Sylvain A1 - Chouikh, Karim A1 - Cons, Lionel A1 - Poznanski, Piotr A1 - Defert, Philippe A1 - Iven, Jan A1 - Kleinwort, Thorsten A1 - Panzer-Steindel, Bernd A1 - Polok, Jaroslaw A1 - Rafflin, Catherine A1 - Silverman, Alan A1 - Smith, Tim A1 - van Eldik, Jan A1 - Front, David A1 - Biasotto, Massimo A1 - Aiftimiei, Cristina A1 - Ferro, Enrico A1 - Maron, Gaetano A1 - Chierici, Andrea A1 - dell’Agnello, Luca A1 - Serra, Marco A1 - Michelotto, Michele A1 - Hess, Lord A1 - Lindenstruth, Volker A1 - Pister, Frank A1 - Steinbeck, Timm A1 - Groep, David A1 - Steenbakkers, Martijn A1 - Koeroo, Oscar A1 - de Cerff, Wim A1 - Venekamp, Gerben A1 - Anderson, Paul A1 - Colles, Tim A1 - Holt, Alexander A1 - Scobie, Alastair A1 - George, Michael A1 - Washbrook, Andrew A1 - Leiva, Rafael T1 - Autonomic Management of Large Clusters and Their Integration into the Grid JF - J. Grid Comput. Y1 - 2004 U6 - https://doi.org/10.1007/s10723-004-7647-3 VL - 2 IS - 3 SP - 247 EP - 260 ER - TY - CHAP A1 - Reinefeld, Alexander A1 - Schintke, Florian ED - von Knop, Jan ED - Haverkamp, Wilhelm ED - Jessen, Eike T1 - Dienste und Standards für das Grid Computing T2 - E-Science and Grid - Ad-hoc-Netze - Medienintegration, 18. DFN-Arbeitstagung über Kommunikationsnetze, Düsseldorf, 2004 Y1 - 2004 UR - http://dl.gi.de/handle/20.500.12116/28585 VL - P-55 SP - 293 EP - 304 PB - GI ER - TY - CHAP A1 - Röblitz, Thomas A1 - Schintke, Florian A1 - Wendler, Jan T1 - Elastic Grid Reservations with User-Defined Optimization Policies T2 - Proceedings of the 2nd Workshop on Adaptive Grid Middleware (AGridM’04), in conjunction with PACT 2004, Antibes Juan-les-Pins, France Y1 - 2004 ER - TY - JOUR A1 - Reinefeld, Alexander A1 - Schintke, Florian T1 - Grid Services: Web Services zur Nutzung verteilter Ressourcen JF - Informatik Spektrum Y1 - 2004 U6 - https://doi.org/10.1007/s00287-004-0379-8 VL - 27 IS - 2 SP - 129 EP - 135 ER - TY - CHAP A1 - Wendler, Jan A1 - Schintke, Florian T1 - Grid-Enabled Computational Fluid Dynamics using FlowGrid T2 - Cracow Grid Workshop ’03 Proceedings Y1 - 2004 SP - 59 EP - 66 PB - Academic Computer Centre CYFRONET AGH CY - ul. Nawojki 11, 30-950 Krakow 61, P.O.Box 386, Poland ER - TY - CHAP A1 - Schütt, Thorsten A1 - Merzky, André A1 - Hutanu, Andrei A1 - Schintke, Florian T1 - Remote partial file access using compact pattern descriptions T2 - 4th IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGrid 2004), April 19-22, 2004, Chicago, Illinois, USA Y1 - 2004 U6 - https://doi.org/10.1109/CCGrid.2004.1336604 SP - 482 EP - 489 PB - IEEE Computer Society ER - TY - CHAP A1 - Reinefeld, Alexander A1 - Schintke, Florian A1 - Schütt, Thorsten T1 - Scalable and Self-Optimizing Data Grids T2 - Annual Review of Scalable Computing Y1 - 2004 U6 - https://doi.org/10.1142/9789812794727_0002 VL - 6 IS - chapter 2 SP - 30 EP - 60 PB - World Scientific ER - TY - JOUR A1 - Wendler, Jan A1 - Schintke, Florian T1 - Executing and observing CFD applications on the Grid JF - Future Generation Computer Systems the International Journal of Grid Computing: Theory, Methods and Applications Y1 - 2005 U6 - https://doi.org/10.1016/j.future.2004.09.026 VL - 21 IS - 1 SP - 11 EP - 18 PB - Elsevier Science Publishers ER - TY - GEN A1 - Reinefeld, Alexander A1 - Schintke, Florian A1 - Schütt, Thorsten T1 - Vorrichtung und Verfahren zum Abrufen / Speichern von elektronischen Daten in einem System mit mehreren Datenverarbeitungseinheiten Y1 - 2007 PB - Europäisches Patent EP 1 744 257 A1 ER - TY - GEN A1 - Reinefeld, Alexander A1 - Schintke, Florian A1 - Schütt, Thorsten T1 - Vorrichtung und Verfahren zum Speichern / Abrufen von Objekten mit mehrdimensional adressierten, elektronischen Daten Y1 - 2007 PB - Europäische Patentanmeldung Nr. 06012030.0 vom 12.06.2006, Patent Nr: 1868114 ER - TY - CHAP A1 - Grimme, Christian A1 - Langhammer, Tobias A1 - Papaspyrou, Alexander A1 - Schintke, Florian T1 - Negotiation-based Choreography of Data-intensive Applications in the C3Grid Project T2 - German E-Science Conference Y1 - 2007 UR - http://edoc.mpg.de/316579 PB - Max Planck Digital Library CY - Baden-Baden ER - TY - CHAP A1 - Plantikow, Stefan A1 - Reinefeld, Alexander A1 - Schintke, Florian ED - Clemm, Alexander ED - Granville, Lisandro ED - Stadler, Rolf T1 - Transactions for Distributed Wikis on Structured Overlays T2 - DSOM Y1 - 2007 U6 - https://doi.org/10.1007/978-3-540-75694-1_25 VL - 4785 SP - 256 EP - 267 PB - Springer CY - Silicon Valley, CA, USA ER - TY - CHAP A1 - Schintke, Florian A1 - Schütt, Thorsten A1 - Reinefeld, Alexander T1 - A Framework for Self-Optimizing Grids Using P2P Components T2 - 14th International Workshop on Database and Expert Systems Applications (DEXA’03), September 1-5, 2003, Prague, Czech Republic Y1 - 2003 U6 - https://doi.org/10.1109/DEXA.2003.1232101 SP - 689 EP - 693 PB - IEEE Computer Society ER - TY - CHAP A1 - Schütt, Thorsten A1 - Schintke, Florian A1 - Reinefeld, Alexander ED - Sloot, Peter ED - Abramson, David ED - Bogdanov, Alexander ED - Dongarra, Jack ED - Zomaya, Albert ED - Gorbachev, Yuri T1 - Efficient Synchronization of Replicated Data in Distributed Systems T2 - Computational Science - ICCS 2003, International Conference, Melbourne, Australia and St. Petersburg, Russia, June 2-4, 2003. Proceedings, Part I Y1 - 2003 U6 - https://doi.org/10.1007/3-540-44860-8_28 VL - 2657 SP - 274 EP - 283 PB - Springer ER - TY - CHAP A1 - Röblitz, Thomas A1 - Schintke, Florian A1 - Reinefeld, Alexander T1 - From Clusters to the Fabric: The Job Management Perspective T2 - 2003 IEEE International Conference on Cluster Computing (CLUSTER 2003), 1-4 December 2003, Kowloon, Hong Kong, China Y1 - 2003 U6 - https://doi.org/10.1109/CLUSTR.2003.1253351 SP - 468 EP - 473 PB - IEEE Computer Society ER - TY - JOUR A1 - Reinefeld, Alexander A1 - Schintke, Florian T1 - Grid Computing in Deutschland JF - Spektrum der Wissenschaft Y1 - 2003 SP - 72 EP - 73 PB - Spektrum der Wissenschaft Verlagsgesellschaft, Heidelberg ER - TY - CHAP A1 - Andrzejak, Artur A1 - Reinefeld, Alexander A1 - Schintke, Florian A1 - Schütt, Thorsten ED - Getov, Vladimir ED - Laforenza, Domenico ED - Reinefeld, Alexander T1 - On Adaptability in Grid Systems T2 - Future Generation Grids: Proceedings of the Workshop on Future Generation Grids, November 1-5, 2004, Dagstuhl, Germany Y1 - 2006 U6 - https://doi.org/10.1007/978-0-387-29445-2_2 SP - 29 EP - 46 PB - Springer ER - TY - JOUR A1 - Röblitz, Thomas A1 - Schintke, Florian A1 - Reinefeld, Alexander T1 - Resource reservations with fuzzy requests JF - Concurrency and Computation: Practice and Experience Y1 - 2006 UR - http://dx.doi.org/10.1002/cpe.1023 U6 - https://doi.org/10.1002/cpe.1023 VL - 18 IS - 13 SP - 1681 EP - 1703 ER - TY - CHAP A1 - Schütt, Thorsten A1 - Schintke, Florian A1 - Reinefeld, Alexander T1 - Structured Overlay without Consistent Hashing: Empirical Results T2 - Sixth Workshop on Global and Peer-to-Peer Computing (GP2PC’06) at Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2006), 16-19 May 2006, Singapore Y1 - 2006 UR - http://doi.ieeecomputersociety.org/10.1109/CCGRID.2006.175 U6 - https://doi.org/10.1109/CCGRID.2006.175 PB - IEEE Computer Society ER - TY - CHAP A1 - Schütt, Thorsten A1 - Schintke, Florian A1 - Reinefeld, Alexander ED - Kermarrec, Anne-Marie T1 - A Structured Overlay for Multi-dimensional Range Queries T2 - Euro-Par Conference Y1 - 2007 UR - http://dx.doi.org/10.1007/978-3-540-74466-5_54 U6 - https://doi.org/10.1007/978-3-540-74466-5_54 VL - 4641 SP - 503 EP - 513 PB - Springer ER - TY - GEN A1 - Reinefeld, Alexander A1 - Schintke, Florian A1 - Schütt, Thorsten T1 - Device and method for retrieving / storing electronic data in a system with a plurality of data processing units Y1 - 2007 PB - United States Patent Application Publication No. US 2007/0165619 A1 ER - TY - CHAP A1 - Plantikow, Stefan A1 - Reinefeld, Alexander A1 - Schintke, Florian T1 - Distributed Wikis on Structured Overlays T2 - CoreGrid Workshop on Grid Programming Models, Grid and P2P System Architecture, Grid Systems, Tools and Environments Y1 - 2007 ER - TY - CHAP A1 - Kruber, Nico A1 - Lange, Maik A1 - Schintke, Florian T1 - Approximate Hash-Based Set Reconciliation for Distributed Replica Repair T2 - 2015 IEEE 34th International Symposium on Reliable Distributed Systems (SRDS) Y1 - 2015 U6 - https://doi.org/10.1109/SRDS.2015.30 SP - 166 EP - 175 PB - IEEE ER - TY - JOUR A1 - Schintke, Florian A1 - Reinefeld, Alexander T1 - Modeling Replica Availability in Large Data Grids JF - J. Grid Computing Y1 - 2003 U6 - https://doi.org/10.1023/B:GRID.0000024086.50333.0d VL - 1 IS - 2 SP - 219 EP - 227 ER - TY - CHAP A1 - Reinefeld, Alexander A1 - Schintke, Florian ED - Monien, Burkhard ED - Feldmann, Rainer T1 - Concepts and Technologies for a Worldwide Grid Infrastructure T2 - Euro-Par 2002, Parallel Processing, 8th International Euro-Par Conference Paderborn, Germany, August 27-30, 2002, Proceedings Y1 - 2002 U6 - https://doi.org/10.1007/3-540-45706-2_6 VL - 2400 SP - 62 EP - 72 PB - Springer ER - TY - CHAP A1 - Kruber, Nico A1 - Schintke, Florian A1 - Berlin, Michael T1 - A Relational Database Schema on the Transactional Key-Value Store Scalaris T2 - Proceedings of 2nd Workshop on Scalable Cloud Data Management Y1 - 2014 U6 - https://doi.org/10.1109/BigData.2014.7004441 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 - 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 - 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 - 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 - 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 - 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 - 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 - GEN A1 - Scheffler, Daniel A1 - Sips, Mike A1 - Behling, Robert A1 - Dransch, Doris A1 - Eggert, Daniel A1 - Fajerski, Jan A1 - Freytag, Johann-Christoph A1 - Griffiths, Patrick A1 - Hollstein, André A1 - Hostert, Patrick A1 - Köthur, Patrick A1 - Peters, Mathias A1 - Pflugmacher, Dirk A1 - Rabe, Andreas A1 - Reinefeld, Alexander A1 - Schintke, Florian A1 - Segel, Karl T1 - GeoMultiSens – Scalable Multisensoral Analysis of Satellite Remote Sensing Data T2 - ESA Living Planet Symposium, EO Open Science Posters Y1 - 2016 ER - TY - CHAP A1 - Scheffler, Daniel A1 - Sips, Mike A1 - Behling, Robert A1 - Dransch, Doris A1 - Eggert, Daniel A1 - Fajerski, Jan A1 - Freytag, Johann-Christoph A1 - Griffiths, Patrick A1 - Hollstein, André A1 - Hostert, Patrick A1 - Köthur, Patrick A1 - Peters, Mathias A1 - Pflugmacher, Dirk A1 - Rabe, Andreas A1 - Reinefeld, Alexander A1 - Schintke, Florian A1 - Segel, Karl T1 - Geomultisens – a common automatic processing and analysis system for multi-sensor satellite data T2 - Advancing Horizons for Land Cover Services Entering the Big Data Era, Second joint Workshop of the EARSeL Special Interest Group on Land Use & Land Cover and the NASA LCLUC Program Y1 - 2016 SP - 18 EP - 19 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 - CHAP A1 - Schmidtke, Robert A1 - Schintke, Florian A1 - Schütt, Thorsten T1 - From Application to Disk: Tracing I/O Through the Big Data Stack T2 - High Performance Computing ISC High Performance 2018 International Workshops, Frankfurt/Main, Germany, June 24 - 28, 2018, Revised Selected Papers, Workshop on Performance and Scalability of Storage Systems (WOPSSS) N2 - Typical applications in data science consume, process and produce large amounts of data, making disk I/O one of the dominating — and thus worthwhile optimizing — factors of their overall performance. Distributed processing frameworks, such as Hadoop, Flink and Spark, hide a lot of complexity from the programmer when they parallelize these applications across a compute cluster. This exacerbates reasoning about I/O of both the application and the framework, through the distributed file system, such as HDFS, down to the local file systems. We present SFS (Statistics File System), a modular framework to trace each I/O request issued by the application and any JVM-based big data framework involved, mapping these requests to actual disk I/O. This allows detection of inefficient I/O patterns, both by the applications and the underlying frameworks, and builds the basis for improving I/O scheduling in the big data software stack. Y1 - 2018 U6 - https://doi.org/10.1007/978-3-030-02465-9_6 SP - 89 EP - 102 ER - TY - CHAP A1 - Clausecker, Robert A1 - Schintke, Florian T1 - A Measure of Quality for IDA* Heuristics T2 - Proceedings of the Fourteenth International Symposium on Combinatorial Search (SoCS 2021) Y1 - 2021 N1 - Best SoCS21 paper award SP - 55 EP - 63 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 - 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 - GEN A1 - Reinefeld, Alexander A1 - Schintke, Florian A1 - Schütt, Thorsten T1 - P2P Routing of Range Queries in Skewed Multidimensional Data Sets N2 - We present a middleware to store multidimensional data sets on Internet-scale distributed systems and to efficiently perform range queries on them. Our structured overlay network \emph{SONAR (Structured Overlay Network with Arbitrary Range queries)} puts keys which are adjacent in the key space on logically adjacent nodes in the overlay and is thereby able to process multidimensional range queries with a single logarithmic data lookup and local forwarding. The specified ranges may have arbitrary shapes like rectangles, circles, spheres or polygons. Empirical results demonstrate the routing performance of SONAR on several data sets, ranging from real-world data to artificially constructed worst case distributions. We study the quality of SONAR's routing information which is based on local knowledge only and measure the indegree of the overlay nodes to find potential hot spots in the routing process. We show that SONAR's routing table is self-adjusting, even under extreme situations, keeping always a maximum of $\lceil \log N \rceil$ routing entries. T3 - ZIB-Report - 07-23 KW - structured overlays KW - range queries KW - routing KW - multidimensional data sets Y1 - 2007 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-9671 SN - 1438-0064 ER - TY - GEN A1 - Schütt, Thorsten A1 - Schintke, Florian A1 - Reinefeld, Alexander T1 - Chord#: Structured Overlay Network for Non-Uniform Load-Distribution N2 - \newcommand{\chordsharp}{Chord$^\##$} Data lookup is a fundamental problem in peer-to-peer systems: Given a key, find the node that stores the associated object. Chord and other P2P algorithms use distributed hash tables (DHTs) to distribute the keys and nodes evenly across a logical ring. Using an efficient routing strategy, DHTs provide a routing performance of $O (\log N)$ in networks of $N$ nodes. While the routing performance has been shown to be optimal, the uniform key distribution makes it impossible for DHTs to support range queries. For range queries, consecutive keys must be stored on lo gically neighboring nodes. In this paper, we present an enhancement of Chord that eliminates the hash function while keeping the same routing performance. The resulting algorithm, named \chordsharp{}, provides a richer function ality while maintaining the same complexity. In addition to Chord, \chordsharp{} adapts to load imbalance. T3 - ZIB-Report - 05-40 KW - DHT KW - P2P KW - Range Queries Y1 - 2005 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-8736 ER - TY - GEN A1 - Reinefeld, Alexander A1 - Stüben, Hinnerk A1 - Schintke, Florian A1 - Din, George T1 - GuiGen: A Toolset for Creating Customized Interfaces for Grid User Communities N2 - \textsf{\itshape{GuiGen}} is a comprehensive set of tools for creating customized graphical user interfaces (GUIs). It draws from the concept of computing portals, which are here seen as interfaces to application-specific computing services for user communities. While \textsf{\itshape{GuiGen}} was originally designed for the use in computational grids, it can be used in client/server environments as well. Compared to other GUI generators, \textsf{\itshape{GuiGen}} is more versatile and more portable. It can be employed in many different application domains and on different target platforms. With \textsf{\itshape{GuiGen}}, application experts (rather than computer scientists) are able to create their own individually tailored GUIs. T3 - ZIB-Report - 02-06 KW - Grid computing KW - customized user interfaces KW - grid user communities KW - web portals KW - XML Y1 - 2002 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-6737 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 - 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 - 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 - 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 - Supporting various interconnects in FLESnet using Libfabric JF - CBM Progress Report 2016 Y1 - 2017 UR - https://repository.gsi.de/record/201318 SN - 978-3-9815227-4-7 SP - 159 EP - 160 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 - 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 - Salem, Farouk A1 - Schintke, Florian T1 - Load balancing mechanism for FLESnet JF - CBM Progress Report 2020 Y1 - 2021 U6 - https://doi.org/10.15120/GSI-2021-00421 SP - 156 EP - 157 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 - JOUR A1 - Lößer, Angar A1 - Witzke, Joel A1 - Schintke, Florian A1 - Scheuermann, Björn T1 - BottleMod: Modeling Data Flows and Tasks for Fast Bottleneck Analysis JF - arXiv Y1 - 2022 U6 - https://doi.org/10.48550/arXiv.2209.05358 SP - 1 EP - 20 ER - TY - JOUR A1 - Leser, Ulf A1 - Hilbrich, Marcus A1 - Draxl, Claudia A1 - Eisert, Peter A1 - Grunske, Lars A1 - Hostert, Patrick A1 - Kainmüller, Dagmar A1 - Kao, Odej A1 - Kehr, Birte A1 - Kehrer, Timo A1 - Koch, Christoph A1 - Markl, Volker A1 - Meyerhenke, Henning A1 - Rabl, Tilmann A1 - Reinefeld, Alexander A1 - Reinert, Knut A1 - Ritter, Kerstin A1 - Scheuermann, Björn A1 - Schintke, Florian A1 - Schweikardt, Nicole A1 - Weidlich, Matthias T1 - The Collaborative Research Center FONDA JF - Datenbank-Spektrum Y1 - 2021 U6 - https://doi.org/10.1007/s13222-021-00397-5 VL - 21 IS - 3 SP - 255 EP - 260 ER - TY - CHAP A1 - Lößer, Angar A1 - Witzke, Joel A1 - Schintke, Florian A1 - Scheuermann, Björn T1 - BottleMod: Modeling Data Flows and Tasks for Fast Bottleneck Analysis T2 - 2022 IEEE International Conference on Big Data, Posters Y1 - 2022 ER - TY - JOUR A1 - Salem, Farouk A1 - Schintke, Florian T1 - Large-Scale Performance of the Data-Flow Scheduler (DFS) and FLESnet JF - CBM Progress Report 2021 Y1 - 2022 U6 - https://doi.org/10.15120/GSI-2022-00599 SP - 170 EP - 171 ER - TY - CHAP A1 - Witzke, Joel A1 - Schintke, Florian A1 - Lößer, Ansgar A1 - Scheuermann, Björn T1 - Proactive Resource Management to Optimize Distributed Workflow Executions T2 - IEEE International Conference on Big Data, BigData 2023, Sorrento, Italy, December 15-18, 2023 Y1 - 2023 U6 - https://doi.org/10.1109/BigData59044.2023.10386493 SP - 6305 EP - 6307 PB - IEEE ER - TY - JOUR A1 - Schintke, Florian A1 - De Mecquenem, Ninon A1 - Guarino, Vanessa Emanuela A1 - Hilbrich, Marcus A1 - Lehmann, Fabian A1 - Sattler, Rebecca A1 - Sparka, Jan Arne A1 - Speckhard, Daniel A1 - Stolte, Hermann A1 - Vu, Anh Duc A1 - Leser, Ulf T1 - Validity Constraints for Data Analysis Workflows JF - arXiv Y1 - 2023 U6 - https://doi.org/10.48550/arXiv.2305.08409 SP - 1 EP - 28 ER - TY - JOUR A1 - Schintke, Florian A1 - Belhajjame, Khalid A1 - De Mecquenem, Ninon A1 - Frantz, David A1 - Guarino, Vanessa Emanuela A1 - Hilbrich, Marcus A1 - Lehmann, Fabian A1 - Missier, Paolo A1 - Sattler, Rebecca A1 - Sparka, Jan Arne A1 - Speckhard, Daniel T. A1 - Stolte, Hermann A1 - Vu, Anh Duc A1 - Leser, Ulf T1 - Validity constraints for data analysis workflows JF - Future Generation Computer Systems Y1 - 2024 U6 - https://doi.org/10.1016/j.future.2024.03.037 VL - 157 SP - 82 EP - 97 ER - TY - CHAP A1 - Gholami, Masoud A1 - Schintke, Florian A1 - Schütt, Thorsten T1 - Checkpoint Scheduling for Shared Usage of Burst-Buffers in Supercomputers T2 - Proceedings of the 47th International Conference on Parallel Processing Companion; SRMPDS 2018: The 14th International Workshop on Scheduling and Resource Management for Parallel and Distributed Systems N2 - User-defined and system-level checkpointing have contrary properties. While user-defined checkpoints are smaller and simpler to recover, system-level checkpointing better knows the global system's state and parameters like the expected mean time to failure (MTTF) per node. Both approaches lead to non-optimal checkpoint time, intervals, sizes, or I/O bandwidth when concurrent checkpoints conflict and compete for it. We combine user-defined and system-level checkpointing to exploit the benefits and avoid the drawbacks of each other. Thus, applications frequently offer to create checkpoints. The system accepts such offers according to the current status and implied costs to recalculate from the last checkpoint or denies them, i.e., immediately lets continue the application without checkpoint creation. To support this approach, we develop economic models for multi-application checkpointing on shared I/O resources that are dedicated for checkpointing (e.g. burst-buffers) by defining an appropriate goal function and solving a global optimization problem. Using our models, the checkpoints of applications on a supercomputer are scheduled to effectively use the available I/O bandwidth and minimize the failure overhead (checkpoint creations plus recalculations). Our simulations show an overall reduction in failure overhead of all nodes of up to 30% for a typical supercomputer workload (HLRN). We can also derive the most cost effective burst-buffer bandwidth for a given node's MTTF and application workload. Y1 - 2018 U6 - https://doi.org/10.1145/3229710.3229755 SP - 44:1 EP - 44:10 ER - TY - CHAP A1 - Weinhold, Carsten A1 - Lackorzynski, Adam A1 - Bierbaum, Jan A1 - Küttler, Martin A1 - Planeta, Maksym A1 - Weisbach, Hannes A1 - Hille, Matthias A1 - Härtig, Hermann A1 - Margolin, Alexander A1 - Sharf, Dror A1 - Levy, Ely A1 - Gak, Pavel A1 - Barak, Amnon A1 - Gholami, Masoud A1 - Schintke, Florian A1 - Schütt, Thorsten A1 - Reinefeld, Alexander A1 - Lieber, Matthias A1 - Nagel, Wolfgang T1 - FFMK: A Fast and Fault-Tolerant Microkernel-Based System for Exascale Computing T2 - Software for Exascale Computing - SPPEXA 2016-2019 Y1 - 2019 U6 - https://doi.org/10.1007/978-3-030-47956-5_16 SP - 483 EP - 516 PB - Springer ER - TY - JOUR A1 - Gholami, Masoud A1 - Schintke, Florian T1 - IOSIG: Declarative I/O-Stream Properties Using Pragmas JF - Datenbank-Spektrum Y1 - 2022 U6 - https://doi.org/10.1007/s13222-022-00419-w VL - 22 IS - 2 SP - 109 EP - 119 PB - Springer Berlin Heidelberg ER - TY - CHAP A1 - Gholami, Masoud A1 - Schintke, Florian T1 - Combining XOR and Partner Checkpointing for Resilient Multilevel Checkpoint/Restart T2 - 2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS) Y1 - 2021 U6 - https://doi.org/10.1109/IPDPS49936.2021.00036 SP - 277 EP - 288 ER - 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 - JOUR A1 - Gholami, Masoud A1 - Schintke, Florian T1 - CAWL: A Cache-aware Write Performance Model of Linux Systems JF - arXiv Y1 - 2023 U6 - https://doi.org/10.48550/arXiv.2306.05701 SP - 1 EP - 22 ER - TY - GEN A1 - Gholami, Masoud A1 - Schintke, Florian A1 - Schütt, Thorsten A1 - Reinefeld, Alexander T1 - Modeling Checkpoint Schedules for Concurrent HPC Applications T2 - CoSaS 2018 International Symposium on Computational Science at Scale Y1 - 2018 ER -