@inproceedings{RoeblitzSchintkeReinefeld2003, author = {R{\"o}blitz, Thomas and Schintke, Florian and Reinefeld, Alexander}, title = {From Clusters to the Fabric: The Job Management Perspective}, booktitle = {2003 IEEE International Conference on Cluster Computing (CLUSTER 2003), 1-4 December 2003, Kowloon, Hong Kong, China}, publisher = {IEEE Computer Society}, doi = {10.1109/CLUSTR.2003.1253351}, pages = {468 -- 473}, year = {2003}, language = {en} } @article{ReinefeldSchintke2003, author = {Reinefeld, Alexander and Schintke, Florian}, title = {Grid Computing in Deutschland}, journal = {Spektrum der Wissenschaft}, publisher = {Spektrum der Wissenschaft Verlagsgesellschaft, Heidelberg}, pages = {72 -- 73}, year = {2003}, language = {en} } @article{SchintkeReinefeld2003, author = {Schintke, Florian and Reinefeld, Alexander}, title = {Modeling Replica Availability in Large Data Grids}, volume = {1}, journal = {J. Grid Computing}, number = {2}, doi = {10.1023/B:GRID.0000024086.50333.0d}, pages = {219 -- 227}, year = {2003}, language = {en} } @inproceedings{KruberSchintkeBerlin2014, author = {Kruber, Nico and Schintke, Florian and Berlin, Michael}, title = {A Relational Database Schema on the Transactional Key-Value Store Scalaris}, booktitle = {Proceedings of 2nd Workshop on Scalable Cloud Data Management}, doi = {10.1109/BigData.2014.7004441}, year = {2014}, language = {en} } @article{AblyazimovAbuhozaAdaketal.2017, author = {Ablyazimov, T. and Abuhoza, A. and Adak, R. P. and Reinefeld, Alexander and Schintke, Florian and et al.,}, title = {Challenges in QCD matter physics - The scientific programme of the Compressed Baryonic Matter experiment at FAIR}, journal = {The European Physical Journal A}, doi = {10.1140/epja/i2017-12248-y}, year = {2017}, language = {en} } @article{SalemSchintkeSchuettetal.2017, author = {Salem, Farouk and Schintke, Florian and Sch{\"u}tt, Thorsten and Reinefeld, Alexander}, title = {Supporting various interconnects in FLESnet using Libfabric}, journal = {CBM Progress Report 2016}, isbn = {978-3-9815227-4-7}, pages = {159 -- 160}, year = {2017}, language = {en} } @inproceedings{KruberLangeSchintke2015, author = {Kruber, Nico and Lange, Maik and Schintke, Florian}, title = {Approximate Hash-Based Set Reconciliation for Distributed Replica Repair}, booktitle = {2015 IEEE 34th International Symposium on Reliable Distributed Systems (SRDS)}, publisher = {IEEE}, doi = {10.1109/SRDS.2015.30}, pages = {166 -- 175}, year = {2015}, language = {en} } @inproceedings{FajerskiNoackReinefeldetal.2016, author = {Fajerski, J. and Noack, Matthias and Reinefeld, Alexander and Schintke, Florian and Sch{\"u}tt, Thorsten and Steinke, Thomas}, title = {Fast In-Memory Checkpointing with POSIX API for Legacy Exascale-Applications}, booktitle = {SPPEXA Symposium 2016}, doi = {10.1007/978-3-319-40528-5_19}, year = {2016}, language = {en} } @misc{ReinefeldStuebenSchintkeetal.2002, author = {Reinefeld, Alexander and St{\"u}ben, Hinnerk and Schintke, Florian and Din, George}, title = {GuiGen: A Toolset for Creating Customized Interfaces for Grid User Communities}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-6737}, number = {02-06}, year = {2002}, abstract = {\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.}, language = {en} } @misc{ReinefeldSchintkeSchuett2007, author = {Reinefeld, Alexander and Schintke, Florian and Sch{\"u}tt, Thorsten}, title = {P2P Routing of Range Queries in Skewed Multidimensional Data Sets}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-9671}, number = {07-23}, year = {2007}, abstract = {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.}, language = {en} } @misc{Schintke2000, type = {Master Thesis}, author = {Schintke, Florian}, title = {Ermittlung von Programmlaufzeiten anhand von Speicherzugriffen, Microbenchmarks und Simulation von Speicherhierarchien}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-10063}, school = {Zuse Institute Berlin (ZIB)}, year = {2000}, abstract = {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ß 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 Zugriffsse-quenz 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.}, language = {de} } @misc{SchuettSchintkeReinefeld2005, author = {Sch{\"u}tt, Thorsten and Schintke, Florian and Reinefeld, Alexander}, title = {Chord\#: Structured Overlay Network for Non-Uniform Load-Distribution}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-8736}, number = {05-40}, year = {2005}, abstract = {\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.}, language = {en} } @article{SalemSchintke2021, author = {Salem, Farouk and Schintke, Florian}, title = {Load balancing mechanism for FLESnet}, journal = {CBM Progress Report 2020}, doi = {10.15120/GSI-2021-00421}, pages = {156 -- 157}, year = {2021}, language = {en} } @article{LeserHilbrichDraxletal.2021, author = {Leser, Ulf and Hilbrich, Marcus and Draxl, Claudia and Eisert, Peter and Grunske, Lars and Hostert, Patrick and Kainm{\"u}ller, Dagmar and Kao, Odej and Kehr, Birte and Kehrer, Timo and Koch, Christoph and Markl, Volker and Meyerhenke, Henning and Rabl, Tilmann and Reinefeld, Alexander and Reinert, Knut and Ritter, Kerstin and Scheuermann, Bj{\"o}rn and Schintke, Florian and Schweikardt, Nicole and Weidlich, Matthias}, title = {The Collaborative Research Center FONDA}, volume = {21}, journal = {Datenbank-Spektrum}, number = {3}, doi = {10.1007/s13222-021-00397-5}, pages = {255 -- 260}, year = {2021}, language = {en} } @article{GholamiSchintke2023, author = {Gholami, Masoud and Schintke, Florian}, title = {CAWL: A Cache-aware Write Performance Model of Linux Systems}, journal = {arXiv}, arxiv = {http://arxiv.org/abs/2306.05701}, doi = {10.48550/arXiv.2306.05701}, pages = {1 -- 22}, year = {2023}, language = {en} } @article{SchintkeDeMecquenemGuarinoetal.2023, author = {Schintke, Florian and De Mecquenem, Ninon and Guarino, Vanessa Emanuela and Hilbrich, Marcus and Lehmann, Fabian and Sattler, Rebecca and Sparka, Jan Arne and Speckhard, Daniel and Stolte, Hermann and Vu, Anh Duc and Leser, Ulf}, title = {Validity Constraints for Data Analysis Workflows}, journal = {arXiv}, arxiv = {http://arxiv.org/abs/2305.08409}, doi = {10.48550/arXiv.2305.08409}, pages = {1 -- 28}, year = {2023}, language = {en} } @article{ClauseckerLemireSchintke2025, author = {Clausecker, Robert and Lemire, Daniel and Schintke, Florian}, title = {Faster Positional-Population Counts for AVX2, AVX-512, and ASIMD}, volume = {37}, journal = {Concurrency and Computation: Practice and Experience}, number = {27-28}, publisher = {Wiley}, issn = {1532-0626}, doi = {10.1002/cpe.70435}, year = {2025}, language = {en} } @misc{SchintkeGrevedeCuveland2024, author = {Schintke, Florian and Greve, Nico and de Cuveland, Jan}, title = {Recent Flesnet developments and work in progress}, journal = {CBM Progress Report 2023}, editor = {Friese, Volker and Gasik, Piotr and Selyuzhenkov, Ilya}, publisher = {GSI Helmholtzzentrum f{\"u}r Schwerionenforschung GmbH}, doi = {10.15120/GSI-2024-00765}, pages = {132}, year = {2024}, language = {en} } @inproceedings{WitzkeLoesserBountrisetal.2024, author = {Witzke, Joel and L{\"o}ßer, Ansgar and Bountris, Vasilis and Schintke, Florian and Scheuermann, Bj{\"o}rn}, title = {I/O of Scientific Workflows Monitored in Detail}, booktitle = {20th IEEE International Conference on e-Science, e-Science 2024, Osaka, Japan, September 16-20, 2024}, doi = {10.1109/E-SCIENCE62913.2024.10678728}, pages = {1 -- 2}, year = {2024}, language = {en} } @article{WitzkeLoesserBountrisetal.2024, author = {Witzke, Joel and L{\"o}ßer, Ansgar and Bountris, Vasilis and Schintke, Florian and Scheuermann, Bj{\"o}rn}, title = {Low-level I/O Monitoring for Scientific Workflows}, volume = {abs/2408.00411}, journal = {CoRR}, arxiv = {http://arxiv.org/abs/2408.00411}, doi = {10.48550/ARXIV.2408.00411}, pages = {1 -- 10}, year = {2024}, language = {en} } @article{ClauseckerLemireSchintke2024, author = {Clausecker, Robert and Lemire, Daniel and Schintke, Florian}, title = {Faster Positional-Population Counts for AVX2, AVX-512, and ASIMD}, volume = {abs/2412.16370}, journal = {CoRR}, doi = {10.48550/arXiv.2412.16370}, pages = {1 -- 23}, year = {2024}, language = {en} } @inproceedings{LoesserWitzkeSchintkeetal.2025, author = {L{\"o}ßer, Ansgar and Witzke, Joel and Schintke, Florian and Scheuermann, Bj{\"o}rn}, title = {BottleMod: Modeling Data Flows and Tasks for Fast Bottleneck Analysis}, booktitle = {Proceedings of the 16th ACM/SPEC International Conference on Performance Engineering (ICPE 2025)}, publisher = {Association for Computing Machinery}, doi = {10.1145/3676151.3719382}, url = {http://nbn-resolving.de/https://doi.org/10.1145/3676151.3719382}, pages = {11 -- 18}, year = {2025}, language = {en} } @inproceedings{LoesserSchlechtSchintkeetal.2025, author = {L{\"o}ßer, Ansgar and Schlecht, Max and Schintke, Florian and Witzke, Joel and Weidlich, Matthias and Scheuermann, Bj{\"o}rn}, title = {Fast Min-ϵ Segmented Regression using Constant-Time Segment Merging}, volume = {267}, booktitle = {Proceedings of the 42nd International Conference on Machine Learning}, pages = {40312 -- 40327}, year = {2025}, language = {en} } @article{AgarwalGreveReinefeldetal.2025, author = {Agarwal, A. and Greve, Nico and Reinefeld, Alexander and Schintke, Florian and et al.,}, title = {Performance of the prototype Silicon Tracking System of the CBM experiment tested with heavy-ion beams at SIS18}, volume = {1082}, journal = {Nuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment}, publisher = {Elsevier BV}, issn = {0168-9002}, arxiv = {http://arxiv.org/abs/2505.20517}, doi = {10.1016/j.nima.2025.171059}, pages = {171059}, year = {2025}, language = {en} } @inproceedings{ClauseckerSchintke2021, author = {Clausecker, Robert and Schintke, Florian}, title = {A Measure of Quality for IDA* Heuristics}, booktitle = {Proceedings of the Fourteenth International Symposium on Combinatorial Search (SoCS 2021)}, pages = {55 -- 63}, year = {2021}, language = {en} } @inproceedings{GholamiSchintke2021, author = {Gholami, Masoud and Schintke, Florian}, title = {Combining XOR and Partner Checkpointing for Resilient Multilevel Checkpoint/Restart}, booktitle = {2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, doi = {10.1109/IPDPS49936.2021.00036}, pages = {277 -- 288}, year = {2021}, language = {en} } @article{LoesserWitzkeSchintkeetal.2022, author = {L{\"o}ßer, Angar and Witzke, Joel and Schintke, Florian and Scheuermann, Bj{\"o}rn}, title = {BottleMod: Modeling Data Flows and Tasks for Fast Bottleneck Analysis}, journal = {arXiv}, arxiv = {http://arxiv.org/abs/2209.05358}, doi = {10.48550/arXiv.2209.05358}, pages = {1 -- 20}, year = {2022}, language = {en} } @inproceedings{LoesserWitzkeSchintkeetal.2022, author = {L{\"o}ßer, Angar and Witzke, Joel and Schintke, Florian and Scheuermann, Bj{\"o}rn}, title = {BottleMod: Modeling Data Flows and Tasks for Fast Bottleneck Analysis}, booktitle = {2022 IEEE International Conference on Big Data, Posters}, year = {2022}, language = {en} } @article{SchintkeBelhajjameDeMecquenemetal.2024, author = {Schintke, Florian and Belhajjame, Khalid and De Mecquenem, Ninon and Frantz, David and Guarino, Vanessa Emanuela and Hilbrich, Marcus and Lehmann, Fabian and Missier, Paolo and Sattler, Rebecca and Sparka, Jan Arne and Speckhard, Daniel T. and Stolte, Hermann and Vu, Anh Duc and Leser, Ulf}, title = {Validity constraints for data analysis workflows}, volume = {157}, journal = {Future Generation Computer Systems}, doi = {10.1016/j.future.2024.03.037}, pages = {82 -- 97}, year = {2024}, language = {en} } @inproceedings{WitzkeSchintkeLoesseretal.2023, author = {Witzke, Joel and Schintke, Florian and L{\"o}ßer, Ansgar and Scheuermann, Bj{\"o}rn}, title = {Proactive Resource Management to Optimize Distributed Workflow Executions}, booktitle = {IEEE International Conference on Big Data, BigData 2023, Sorrento, Italy, December 15-18, 2023}, publisher = {IEEE}, doi = {10.1109/BigData59044.2023.10386493}, pages = {6305 -- 6307}, year = {2023}, language = {en} } @article{SalemSchintke2022, author = {Salem, Farouk and Schintke, Florian}, title = {Large-Scale Performance of the Data-Flow Scheduler (DFS) and FLESnet}, journal = {CBM Progress Report 2021}, doi = {10.15120/GSI-2022-00599}, pages = {170 -- 171}, year = {2022}, language = {en} } @article{GholamiSchintke2022, author = {Gholami, Masoud and Schintke, Florian}, title = {IOSIG: Declarative I/O-Stream Properties Using Pragmas}, volume = {22}, journal = {Datenbank-Spektrum}, number = {2}, publisher = {Springer Berlin Heidelberg}, doi = {10.1007/s13222-022-00419-w}, pages = {109 -- 119}, year = {2022}, language = {en} } @misc{RamakiSchintke2025, author = {Ramaki, Niaz Mohammad and Schintke, Florian}, title = {Ensuring Reproducibility in Stream Processing with Blockchain Technologies}, journal = {2025 11th International Conference on Computer and Communications (ICCC)}, publisher = {IEEE}, doi = {10.1109/ICCC68654.2025.11437772}, pages = {1383 -- 1391}, year = {2025}, language = {en} } @misc{KharmaWiesSchintke2026, author = {Kharma, Sami and Wies, Tobias and Schintke, Florian}, title = {Comprehensive Plugin-Based Monitoring of Nexflow Workflow Executions}, journal = {SCA/HPC Asia 2026}, arxiv = {http://arxiv.org/abs/2603.28783}, year = {2026}, language = {en} }