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 - 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 - 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 - 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 - 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 - GEN A1 - Hupfeld, Felix T1 - Hierarchical Structures in Attribute-based Namespaces and their Application to Browsing N2 - While attribute-value pairs are a popular method to name objects, information retrieval from those attribute-based namespaces is not an easy task. The user has to recall correct attribute names and values and master the syntax and semantics of query formulation. This paper describes hierarchical structures in attribute-based namespaces, shows how to extract them efficiently and evaluates the quality of these structures in an user experiment. It proposes an user interface for browsing attribute-named object sets which makes this task resemble todays file-system browsers and compares the usability of this interface to normal form-based methods in an user study. T3 - ZIB-Report - 03-06 Y1 - 2002 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-7280 ER - TY - CHAP ED - Bal, H. ED - Löhr, K.-P. ED - Reinefeld, Alexander T1 - 2nd IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2002), 22-24 May 2002, Berlin, Germany Y1 - 2002 SN - 0-7695-1582-7 PB - IEEE Computer Society 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 - 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 - Rolia, Jerry A1 - Zhu, Xiaoyun A1 - Arlitt, Martin A1 - Andrzejak, Artur T1 - Statistical Service Assurances for Applications in Utility Grid Environments T2 - 10th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2002), 11-16 October 2002, Fort Worth, Texas, USA Y1 - 2002 U6 - https://doi.org/10.1109/MASCOT.2002.1167084 SP - 247 EP - 256 PB - IEEE Computer Society ER - TY - JOUR A1 - Busch, Hubert A1 - Heidl, Sebastian A1 - Staudemeyer, Ralf A1 - Stolle, Manfred T1 - Teleimmersion – Erfahrungen mit der Gigabit-Ethernet-Strecke zwischen Berlin und Hannover JF - DFN-Mitteilungen Y1 - 2002 VL - 58(3) SP - 7 EP - 9 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 - THES A1 - Schütt, Thorsten T1 - Synchronisation von verteilten Verzeichnisstrukturen N2 - Das Management von großen Datenmengen spielt eine immer wichtigere Rolle, wie aktuelle Entwicklungen in der Hochenergiephysik [2] zeigen. Für das DataGrid-Projekt zum Beispiel ist es notwendig, große Datenmengen auf mehrere Rechenzentren in Europa zu verteilen und die Daten untereinander zu synchronisieren. Auch innerhalb von Clustern gewinnen mit zunehmender Anzahl der Knoten Werkzeuge zur effizienten Synchronisation und Verteilung von Daten an Bedeutung. Im Rahmen dieser Arbeit wurde ein effizientes Verfahren zur Synchronisation von verteilten Verzeichnisstrukturen entwickelt und implementiert. Mit diesem Verfahren ist es möglich, unabhängige Änderungen an beliebigen Repositories gleichzeitig durchzuführen. Das Verfahren benötigt keine zentrale Instanz, wodurch eine gegenüber vielen existierenden Verfahren verbesserte Skalierbarkeit erreicht werden konnte. Dabei wurden Erkenntnisse aus der Graphentheorie eingesetzt und weiterentwickelt, um die Netzwerktopolo-gie und -handbreiten zwischen den Rechnern zu berücksichtigen. Durch die Verwendung einer Offline-Synchronisation werden Änderungen erst dann an andere Rechner propagiert, wenn der Nutzer dies anstößt. Das kann zum Beispiel nach einer abgeschlossenen Transaktion, die Änderungen an mehreren Dateien beinhaltet, angemessen sein. N2 - Current developments in high energy physics [2] show that the management of large datasets plays an important role. For the DataGrid project it is necessary to distribute large datasets over several computing centers all over Europe and to synchronize these datasets. Within clusters tools for efficient synchronization and distribution of data become more important, too. In this thesis, a method to synchronize distributed directory structures was developed and implemented which makes it possible to perform independent changes to arbitrary repositories simultaneously. This method needs no central instance and therefore the presented system achieves a better scalability than many existing systems. Knowledge from graph theory was used and improved to take the network topology and the network bandwidth between the computers into account. By using offline synchronization, changes will only be propagated when the user initiates it. This can be reasonable after a completed transaction which consists of changes on several files. Y1 - 2002 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-10071 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 - CHAP A1 - Wendler, Jan A1 - Bach, Joscha ED - Polani, Daniel ED - Browning, Brett ED - Bonarini, Andrea ED - Yoshida, Kazuo T1 - Recognizing and Predicting Agent Behavior with Case Based Reasoning T2 - RoboCup 2003: Robot Soccer World Cup VII Y1 - 2003 U6 - https://doi.org/10.1007/978-3-540-25940-4_72 VL - 3020 SP - 729 EP - 738 PB - Springer ER - TY - JOUR A1 - Graupner, Sven A1 - Kotov, Vadim A1 - Andrzejak, Artur A1 - Trinks, Holger T1 - Service-Centric Globally Distributed Computing JF - IEEE Internet Computing Y1 - 2003 U6 - https://doi.org/10.1109/MIC.2003.1215658 VL - 7 IS - 4 SP - 36 EP - 43 CY - Los Alamitos, CA, USA ER - TY - CHAP A1 - Graupner, Sven A1 - Andrzejak, Artur A1 - Kotov, Vadim ED - Banissi, Ebad ED - Börner, Katy ED - Chen, Chaomei ED - Clapworthy, Gordon ED - Maple, Carsten ED - Lobben, Amy ED - Moore, Christopher ED - Roberts, Jonathan ED - Ursyn, Anna ED - Zhang, Jian-Ping T1 - Visualizing Topology in Self-Organizing Management Overlays T2 - Seventh International Conference on Information Visualization, IV 2003, 16-18 July 2003, London, UK Y1 - 2003 U6 - https://doi.org/10.1109/IV.2003.1217980 SP - 200 EP - 205 PB - IEEE Computer Society 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 - Graupner, Sven A1 - Andrzejak, Artur A1 - Kotov, Vadim A1 - Trinks, Holger T1 - Adaptive Control Overlay for Service Management T2 - First Workshop on the Design of Self-Managing Systems (AASMS’03) Y1 - 2003 CY - San Francisco ER - TY - CHAP A1 - Rolia, Jerry A1 - Andrzejak, Artur A1 - Arlitt, Martin ED - Brunner, Marcus ED - Keller, Alexander T1 - Automating Enterprise Application Placement in Resource Utilities T2 - Self-Managing Distributed Systems, 14th IFIP/IEEE International Workshop on Distributed Systems Y1 - 2003 U6 - https://doi.org/10.1007/978-3-540-39671-0_11 VL - 2867 SP - 118 EP - 129 PB - Springer Berlin / Heidelberg ER - TY - CHAP A1 - Rother, Kristian A1 - Trissl, S. A1 - Müller, H. A1 - May, Patrick A1 - Heek, R. A1 - Preissner, Robert A1 - Steinke, Thomas A1 - Koch, Ina A1 - Leser, Ulf A1 - Frömmel, Cornelius ED - Christophe, C. ED - Lenhof, H.-P. ED - Sagot, M.-F. T1 - Columba - A Database of Annotations of Protein Structure T2 - ECCB - Proceedings of the European Conference on Computational Biology in conjunction with the French National Conference on Bioinformatics Y1 - 2003 SP - 109 EP - 110 ER - TY - CHAP A1 - Andrzejak, Artur A1 - Fukuda, Komei ED - Hamza, M. T1 - Debugging Distributed Computations by Reverse Search T2 - The 21st IASTED International Multi-Conference on Applied Informatics (AI 2003), February 10-13, 2003, Innsbruck, Austria Y1 - 2003 SP - 719 EP - 725 PB - IASTED/ACTA Press 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 - Cordes, Frank A1 - Preissner, Robert A1 - Steinke, Thomas T1 - How Does a Protein Work? JF - BioTOPics J. of Biotechnology Berlin-Brandenburg Y1 - 2003 VL - 18 IS - 2 SP - 4 EP - 5 ER - TY - JOUR A1 - Andrzejak, Artur A1 - Welzl, Emo T1 - In between k-Sets, j-Facets, and i-Faces: (i , j) - Partition JF - Discrete & Computational Geometry Y1 - 2003 U6 - https://doi.org/s00454-002-2778-4 VL - 29 IS - 1 SP - 105 EP - 131 ER - TY - CHAP A1 - Andrzejak, Artur ED - Banissi, Ebad ED - Börner, Katy ED - Chen, Chaomei ED - Clapworthy, Gordon ED - Maple, Carsten ED - Lobben, Amy ED - Moore, Christopher ED - Roberts, Jonathan ED - Ursyn, Anna ED - Zhang, Jian-Ping T1 - Memory-Efficient and Fast Enumeration of Global States T2 - Seventh International Conference on Information Visualization, IV 2003, 16-18 July 2003, London, UK Y1 - 2003 U6 - https://doi.org/10.1109/IV.2003.1217978 SP - 189 EP - 193 PB - IEEE Computer Society 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 - May, Patrick A1 - Koch, Ina ED - Christophe, C. ED - Lenhof, H.-P. ED - Sagot, M.-F. T1 - PTGL - Protein Topology Graph Library T2 - ECCB - Proceedings of the European Conference on Computational Biology in conjunction with the French National Conference on Bioinformatics Y1 - 2003 SP - 193 EP - 194 ER - TY - THES A1 - Rieche, Simon T1 - Lastbalancierung in Peer-to-Peer Systemen N2 - Peer-to-Peer (P2P) Systeme werden u.a. zur Verwaltung von großen Datenmengen benutzt, die auf verschiedene Rechner verteilt sind. Benutzern soll damit der Zugriff auf Daten innerhalb des Systems leicht ermöglicht werden. Damit in P2P Systemen die Daten effizient verteilt und gesucht werden können, existieren Distributed Hash Tables. Distributed Hash Tables (DHT) sind eine Methode, um globale Informationen persistent speichern zu können. Der Wertebereich der Hashfunktion, welche die zu veröffentlichenden Einträge auf Werte abbildet, wird in Abschnitte aufgeteilt, die einzelnen Knoten zugeteilt werden. Die meisten DHTs haben aber ein Problem bei der Verteilung der Last. Die verschiedenen DHT Systeme beruhen meist auf einem identischen Ansatz der Lastverteilung. Die Last wird nur mit Hilfe einer Hashfunktion verteilt. Es wird davon ausgegangen, dass diese Funktion die Last gleichmäßig verteilt. Im Rahmen dieser Arbeit wurde ein Verfahren zur Last Verteilung entwickelt, simuliert und implementiert. Bei dem Verfahren wird die Last wie bei der Verteilung von Wärme an die Umgebung abgegeben. Es wird mit existierenden Lastbalancierungsalgorithmen verglichen. Mit diesem neuen Verfahren ist es möglich, Last in DHTs besser zu verteilen ohne große Änderungen an den DHTs vorzunehmen. Es wird gezeigt, wie mit dem Verfahren zusätzlich die Fehlertoleranz des P2P Systems erhöht werden kann. N2 - One of the many uses of Peer-to-Peer (P2P) systems is the administration of large data sets that are distributed across different computers, with the goal of facilitating user access to files within the system. Distributed Hash Tables (DHT) are designed to enable the efficient distribution and search of files, by allowing global information to be persistently stored. The range of values of the hash function (the possible entries in the published hash table) are assigned to individual nodes. Most DHTs, however, have a problem with load distribution. The various DHT systems usually operate by distributing load equally among nodes. Thus the load is distributed using the help of the hash function. One assumes this function distributes the load evenly. In the context of this work a method of distributing load has been developed, simulated and implemented. With this method load is transferred in a fashion analogous to the dissipation of heat into the environment. Comparisons with existing algorithms for load balancing are drawn. With the new procedure it is possible to better distribute load in DHTs without requiring major changes to the DHTs themselves. It is shown that with the procedure the fault tolerance of P2P systems may also be increased. Y1 - 2003 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-10048 ER - TY - CHAP A1 - Michalsky, E. A1 - Goede, A. A1 - Preissner, Robert A1 - May, Patrick A1 - Steinke, Thomas T1 - A distributed pipeline for structure prediction T2 - CASP6 Abstract Book, Sixth Meeting on the Critical Assessment of Techniques for Protein Structure Prediction, Gaeta, Italy Y1 - 2004 SP - 112 EP - 114 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 - JOUR A1 - Xiao, Li A1 - Zhang, Xiaodong A1 - Andrzejak, Artur A1 - Chen, Songqing T1 - Building a Large and Efficient Hybrid Peer-to-Peer Internet Caching System JF - IEEE Trans. Knowl. Data Eng. Y1 - 2004 U6 - https://doi.org/10.1109/TKDE.2004.1 VL - 16 IS - 6 SP - 754 EP - 769 ER - TY - CHAP A1 - Rother, Kristian A1 - Müller, Heiko A1 - Trißl, Silke A1 - Koch, Ina A1 - Steinke, Thomas A1 - Preissner, Robert A1 - Frömmel, Cornelius A1 - Leser, Ulf ED - Rahm, Erhard T1 - Columba: Multidimensional Data Integration of Protein Annotations T2 - Data Integration in the Life Sciences, First International Workshop, DILS 2004, Leipzig, Germany, March 25-26 Y1 - 2004 U6 - https://doi.org/10.1007/978-3-540-24745-6_11 VL - 2994 SP - 156 EP - 171 PB - Springer Berlin / Heidelberg 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 - Hupfeld, Felix T1 - Log-Structured Storage for Efficient Weakly-Connected Replication T2 - 24th International Conference on Distributed Computing Systems Workshops (ICDCS 2004 Workshops), 23-24 March 2004, Hachioji, Tokyo, Japan Y1 - 2004 U6 - https://doi.org/10.1109/ICDCSW.2004.1284072 SP - 458 EP - 463 PB - IEEE Computer Society ER - TY - GEN A1 - Campadello, Stefano A1 - De Roure, David A1 - Farshchian, Bahador A1 - Fehse, Meike A1 - Goble, Carole A. A1 - Gui, Yunmiao A1 - Hermenegildo, Manuel V. A1 - Jeffery, Karl A1 - Laforenza, Domenico A1 - Maccallum, Peter A1 - Masso, Jordi A1 - Priol, Thierry A1 - Reinefeld, Alexander A1 - Riguidel, Michel A1 - Snelling, David A1 - Talia, Domenico A1 - Varvarigou, Theodora A. T1 - Next Generation Grids 2 - Requirements and Options for European Grids Research 2005-2010 and Beyond Y1 - 2004 UR - http://www.cordis.lu/ist/grids/pub-report.htm PB - NGG2 Group ER - TY - JOUR A1 - May, Patrick A1 - Barthel, Stefan A1 - Koch, Ina T1 - PTGL - a web-based database application for protein topologies JF - Bioinformatics Y1 - 2004 U6 - https://doi.org/10.1093/bioinformatics/bth367 VL - 20 IS - 17 SP - 3277 EP - 3279 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 - May, Patrick A1 - Steinke, Thomas A1 - Meyer, Michael T1 - THESEUS: A Parallel Threading Core T2 - Procs. 12th Internat. Conf. on Intelligent Systems for Mol. Bio. (ISMB) and 3rd European Conf. on Comp. Bio. (ECCB), Glasgow Y1 - 2004 SP - 199 ER - TY - JOUR A1 - Rolia, Jerry A1 - Zhu, Xiaoyun A1 - Arlitt, Martin A1 - Andrzejak, Artur T1 - Statistical service assurances for applications in utility Grid environments JF - Performance Evaluation Y1 - 2004 U6 - https://doi.org/10.1016/j.peva.2004.07.015 VL - 58 IS - 2-3 SP - 319 EP - 339 ER - TY - CHAP A1 - May, Patrick A1 - Krause, F. A1 - Ehrlich, C. A1 - Maaskola, J. A1 - Steinke, Thomas T1 - ZIB threading pipeline - A webservice-based, distributed structure prediction workflow. T2 - Proceedings of the German Conference on Bioinformatics (GCB) Y1 - 2005 SP - 125 EP - 126 ER - TY - JOUR A1 - Andrzejak, Artur A1 - Ceyran, Mehmet T1 - Characterizing and Predicting Resource Demand by Periodicity Mining JF - J. Network Syst. Manage., Special Issue on Self-Managing Systems and Networks Y1 - 2005 VL - 13 IS - 2 ER - TY - CHAP A1 - Röblitz, Thomas A1 - Reinefeld, Alexander T1 - Co-reservation with the concept of virtual resources T2 - 5th International Symposium on Cluster Computing and the Grid (CCGrid 2005), 9-12 May, 2005, Cardiff, UK Y1 - 2005 UR - http://doi.ieeecomputersociety.org/10.1109/CCGRID.2005.1558582 SP - 398 EP - 406 PB - IEEE Computer Society ER - TY - JOUR A1 - Trißl, Silke A1 - Rother, Kristian A1 - Müller, Heiko A1 - Steinke, Thomas A1 - Koch, Ina A1 - Preissner, Robert A1 - Frömmel, Cornelius A1 - Leser, Ulf T1 - Columba: an integrated database of proteins, structures, and annotations JF - BMC Bioinformatics Y1 - 2005 U6 - https://doi.org/10.1186/1471-2105-6-81 VL - 6 SP - 81 EP - 92 ER -