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 - 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 - 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 - 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 - 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 - 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 -