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 - 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 - 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 - 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 - 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 - 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 - 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 - 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 - 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 - 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 - 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 - 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 - 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 - 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 - 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 - 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 - 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 - Clausecker, Robert A1 - Lemire, Daniel A1 - Schintke, Florian T1 - Faster Positional‐Population Counts for AVX2, AVX‐512, and ASIMD JF - Concurrency and Computation: Practice and Experience Y1 - 2025 U6 - https://doi.org/10.1002/cpe.70435 SN - 1532-0626 VL - 37 IS - 27-28 PB - Wiley ER - TY - GEN A1 - Schintke, Florian A1 - Greve, Nico A1 - de Cuveland, Jan ED - Friese, Volker ED - Gasik, Piotr ED - Selyuzhenkov, Ilya T1 - Recent Flesnet developments and work in progress T2 - CBM Progress Report 2023 Y1 - 2024 U6 - https://doi.org/10.15120/GSI-2024-00765 SP - 132 PB - GSI Helmholtzzentrum für Schwerionenforschung GmbH ER - TY - CHAP A1 - Witzke, Joel A1 - Lößer, Ansgar A1 - Bountris, Vasilis A1 - Schintke, Florian A1 - Scheuermann, Björn T1 - I/O of Scientific Workflows Monitored in Detail T2 - 20th IEEE International Conference on e-Science, e-Science 2024, Osaka, Japan, September 16-20, 2024 Y1 - 2024 U6 - https://doi.org/10.1109/E-SCIENCE62913.2024.10678728 N1 - Best Poster Award SP - 1 EP - 2 ER - TY - JOUR A1 - Witzke, Joel A1 - Lößer, Ansgar A1 - Bountris, Vasilis A1 - Schintke, Florian A1 - Scheuermann, Björn T1 - Low-level I/O Monitoring for Scientific Workflows JF - CoRR Y1 - 2024 U6 - https://doi.org/10.48550/ARXIV.2408.00411 VL - abs/2408.00411 SP - 1 EP - 10 ER - TY - JOUR A1 - Clausecker, Robert A1 - Lemire, Daniel A1 - Schintke, Florian T1 - Faster Positional-Population Counts for AVX2, AVX-512, and ASIMD JF - CoRR Y1 - 2024 U6 - https://doi.org/10.48550/arXiv.2412.16370 VL - abs/2412.16370 SP - 1 EP - 23 ER - TY - CHAP A1 - Lößer, Ansgar A1 - Witzke, Joel A1 - Schintke, Florian A1 - Scheuermann, Björn T1 - BottleMod: Modeling Data Flows and Tasks for Fast Bottleneck Analysis T2 - Proceedings of the 16th ACM/SPEC International Conference on Performance Engineering (ICPE 2025) Y1 - 2025 U6 - http://nbn-resolving.de/urn/resolver.pl?https://doi.org/10.1145/3676151.3719382 SP - 11 EP - 18 PB - Association for Computing Machinery ER - TY - CHAP A1 - Lößer, Ansgar A1 - Schlecht, Max A1 - Schintke, Florian A1 - Witzke, Joel A1 - Weidlich, Matthias A1 - Scheuermann, Björn T1 - Fast Min-ϵ Segmented Regression using Constant-Time Segment Merging T2 - Proceedings of the 42nd International Conference on Machine Learning Y1 - 2025 UR - https://proceedings.mlr.press/v267/losser25a.html VL - 267 SP - 40312 EP - 40327 ER - TY - JOUR A1 - Agarwal, A. A1 - Greve, Nico A1 - Reinefeld, Alexander A1 - Schintke, Florian A1 - et al., T1 - Performance of the prototype Silicon Tracking System of the CBM experiment tested with heavy-ion beams at SIS18 JF - Nuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment Y1 - 2025 U6 - https://doi.org/10.1016/j.nima.2025.171059 SN - 0168-9002 N1 - This paper has 343 authors. For the complete list of authors use the DOI, please. VL - 1082 SP - 171059 PB - Elsevier BV 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 - 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 - 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 - 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 - 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 - 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 - 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 - 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 - GEN A1 - Ramaki, Niaz Mohammad A1 - Schintke, Florian T1 - Ensuring Reproducibility in Stream Processing with Blockchain Technologies T2 - 2025 11th International Conference on Computer and Communications (ICCC) Y1 - 2025 U6 - https://doi.org/10.1109/ICCC68654.2025.11437772 SP - 1383 EP - 1391 PB - IEEE ER - TY - GEN A1 - Kharma, Sami A1 - Wies, Tobias A1 - Schintke, Florian T1 - Comprehensive Plugin-Based Monitoring of Nexflow Workflow Executions T2 - SCA/HPC Asia 2026 Y1 - 2026 UR - https://www.sc-asia.org/2026/data/poster/post140.pdf ER -