@inproceedings{WendeSteinkeReinefeld2015, author = {Wende, Florian and Steinke, Thomas and Reinefeld, Alexander}, title = {The Impact of Process Placement and Oversubscription on Application Performance: A Case Study for Exascale Computing}, booktitle = {Proceedings of the 3rd International Conference on Exascale Applications and Software, EASC 2015}, editor = {Gray, A. and Smith, L. and Weiland, M.}, publisher = {The University of Edinburgh}, isbn = {978 -0-9 926615 -1-9}, pages = {13 -- 18}, year = {2015}, language = {en} } @inproceedings{WeinholdLackorzynskiBierbaumetal.2016, author = {Weinhold, Carsten and Lackorzynski, Adam and Bierbaum, Jan and K{\"u}ttler, Martin and Planeta, Maksym and H{\"a}rtig, Hermann and Shiloh, Amnon and Levy, Ely and Ben-Nun, Tal and Barak, Amnon and Steinke, Thomas and Sch{\"u}tt, Thorsten and Fajerski, Jan and Reinefeld, Alexander and Lieber, Matthias and Nagel, Wolfgang}, title = {FFMK: A Fast and Fault-tolerant Microkernel-based System for Exascale Computing}, booktitle = {SPPEXA Symposium 2016}, doi = {10.1007/978-3-319-40528-5_18}, year = {2016}, 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{DeuflhardKleinReinefeldetal.1999, author = {Deuflhard, Peter and Klein, Rupert and Reinefeld, Alexander and St{\"u}ben, Hinnerk}, title = {Power-User und Supercomputer}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-4070}, number = {SC-99-19}, year = {1999}, abstract = {Abstract-Sammlung zum gleichnamigen Workshop am ZIB vom 19.--20. Mai 1999}, language = {de} } @misc{ReinefeldLindenstruth2001, author = {Reinefeld, Alexander and Lindenstruth, Volker}, title = {How to Build a High-Performance Compute Cluster for the Grid}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-6374}, number = {01-11}, year = {2001}, abstract = {The success of large-scale multi-national projects like the forthcoming analysis of the LHC particle collision data at CERN relies to a great extent on the ability to efficiently utilize computing a management software (Datagrid, Globus, etc.), while the effective integration of computing nodes has been largely neglected up to now. This is the focus of our work. We present a framework for a high-performance cluster that can be used as a reliable computing node in the Grid. We outline the cluster architecture, the management of distributed data and the seamless intergration of the cluster into the Grid environment.}, 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{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{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{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} }