<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>7872</id>
    <completedYear/>
    <publishedYear>2002</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>131</pageFirst>
    <pageLast>131</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>2400</volume>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Performance Evaluation, Analysis and Optimization</title>
    <parentTitle language="eng">Euro-Par 2002 Parallel Processing</parentTitle>
    <identifier type="doi">10.1007/3-540-45706-2_15</identifier>
    <enrichment key="Series">LNCS</enrichment>
    <enrichment key="PeerReviewed">no</enrichment>
    <author>Barton P. Miller</author>
    <submitter>Florian Schintke</submitter>
    <author>Jesús Labarta</author>
    <author>Florian Schintke</author>
    <author>Jens Simon</author>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="persons" number="schintke">Schintke, Florian</collection>
    <collection role="projects" number="no-project">no-project</collection>
  </doc>
  <doc>
    <id>7873</id>
    <completedYear/>
    <publishedYear>2010</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>444</pageFirst>
    <pageLast>445</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>6271</volume>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Peer-to-Peer Computing</title>
    <parentTitle language="eng">Euro-Par 2010 - Parallel Processing</parentTitle>
    <identifier type="doi">10.1007/978-3-642-15277-1_42</identifier>
    <enrichment key="Series">LNCS</enrichment>
    <enrichment key="PeerReviewed">no</enrichment>
    <author>Adriana Iamnitchi</author>
    <submitter>Florian Schintke</submitter>
    <author>Paolo Trunfio</author>
    <author>Jonathan Ledlie</author>
    <author>Florian Schintke</author>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="persons" number="schintke">Schintke, Florian</collection>
    <collection role="projects" number="no-project">no-project</collection>
  </doc>
  <doc>
    <id>7836</id>
    <completedYear/>
    <publishedYear>2001</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>569</pageFirst>
    <pageLast>578</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>2074</volume>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2001-07-17</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Cache Simulator for Shared Memory Systems</title>
    <parentTitle language="eng">Computational Science - ICCS 2001</parentTitle>
    <identifier type="doi">10.1007/3-540-45718-6_62</identifier>
    <enrichment key="Series">LNCS</enrichment>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <author>Florian Schintke</author>
    <submitter>Florian Schintke</submitter>
    <author>Jens Simon</author>
    <author>Alexander Reinefeld</author>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="persons" number="reinefeld">Reinefeld, Alexander</collection>
    <collection role="persons" number="schintke">Schintke, Florian</collection>
    <collection role="projects" number="no-project">no-project</collection>
  </doc>
  <doc>
    <id>7895</id>
    <completedYear/>
    <publishedYear>2020</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Transactions on Red-black and AVL trees in NVRAM</title>
    <parentTitle language="eng">arXiv</parentTitle>
    <identifier type="arxiv">2006.16284</identifier>
    <enrichment key="PeerReviewed">no</enrichment>
    <author>Thorsten Schütt</author>
    <submitter>Florian Schintke</submitter>
    <author>Florian Schintke</author>
    <author>Jan Skrzypczak</author>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="persons" number="schintke">Schintke, Florian</collection>
    <collection role="persons" number="schuett">Schütt, Thorsten</collection>
    <collection role="persons" number="skrzypczak">Skrzypczak, Jan</collection>
    <collection role="projects" number="2017-rbrcseq">2017-rbrcseq</collection>
  </doc>
  <doc>
    <id>7876</id>
    <completedYear/>
    <publishedYear>2003</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1</pageFirst>
    <pageLast>8</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Towards automation of computing fabrics using tools from the fabric management workpackage of the EU DataGrid project</title>
    <parentTitle language="eng">Computing in High Energy and Nuclear Physics (CHEP03)</parentTitle>
    <identifier type="arxiv">cs/0305050</identifier>
    <enrichment key="PeerReviewed">no</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <author>Olof Bärring</author>
    <submitter>Florian Schintke</submitter>
    <author>Maite Barroso Lopez</author>
    <author>German Cancio</author>
    <author>Thomas Röblitz</author>
    <author>Florian Schintke</author>
    <author> et al.</author>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="persons" number="schintke">Schintke, Florian</collection>
    <collection role="projects" number="no-project">no-project</collection>
  </doc>
  <doc>
    <id>7877</id>
    <completedYear/>
    <publishedYear>2020</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>167</pageFirst>
    <pageLast>168</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Handling Compute-Node Failures in FLESnet</title>
    <parentTitle language="eng">CBM Progress Report 2019</parentTitle>
    <identifier type="doi">10.15120/GSI-2020-00904</identifier>
    <identifier type="isbn">978-3-9815227-8-5</identifier>
    <enrichment key="PeerReviewed">no</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <author>Farouk Salem</author>
    <submitter>Florian Schintke</submitter>
    <author>Florian Schintke</author>
    <author>Alexander Reinefeld</author>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="persons" number="reinefeld">Reinefeld, Alexander</collection>
    <collection role="persons" number="schintke">Schintke, Florian</collection>
    <collection role="projects" number="2015-CBM-FLES-SACK">2015-CBM-FLES-SACK</collection>
  </doc>
  <doc>
    <id>7419</id>
    <completedYear/>
    <publishedYear>2019</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>455</pageFirst>
    <pageLast>457</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Linearizable State Machine Replication of State-Based CRDTs without Logs</title>
    <abstract language="eng">General solutions of state machine replication have to ensure that all replicas apply the same commands in the same order, even in the presence of failures. Such strict ordering incurs high synchronization costs due to the use of distributed consensus or a leader.&#13;
This paper presents a protocol for linearizable state machine replication of conflict-free replicated data types (CRDTs) that neither requires consensus nor a leader. By leveraging the properties of state-based CRDTs—in particular the monotonic growth of a join semilattice—synchronization overhead is greatly reduced. In addition, updates just need a single round trip and modify the state ‘in-place’ without the need for a log. Furthermore, the message size overhead for coordination consists of a single counter per message. While reads in the presence of concurrent updates are not wait-free without a coordinator, we show that more than 97 % of reads can be handled in one or two round trips under highly concurrent accesses.&#13;
Our protocol achieves high throughput without auxiliary processes such as command log management or leader election. It is well suited for all practical scenarios that need linearizable access on CRDT data on a fine-granular scale.</abstract>
    <parentTitle language="eng">Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019</parentTitle>
    <identifier type="doi">10.1145/3293611.3331568</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <author>Jan Skrzypczak</author>
    <submitter>Florian Schintke</submitter>
    <author>Florian Schintke</author>
    <author>Thorsten Schütt</author>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="persons" number="schintke">Schintke, Florian</collection>
    <collection role="persons" number="schuett">Schütt, Thorsten</collection>
    <collection role="persons" number="skrzypczak">Skrzypczak, Jan</collection>
    <collection role="projects" number="2017-rbrcseq">2017-rbrcseq</collection>
  </doc>
  <doc>
    <id>7421</id>
    <completedYear/>
    <publishedYear>2019</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1</pageFirst>
    <pageLast>11</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Learned Clause Minimization in Parallel SAT Solvers</title>
    <abstract language="eng">Learned clauses minimization (LCM) let to performance improvements of modern SAT solvers especially in solving hard SAT instances. Despite the success of LCM approaches in sequential solvers, they are not widely incorporated in parallel SAT solvers. In this paper we explore the potential of LCM for parallel SAT solvers by defining multiple LCM approaches based on clause vivification, comparing their runtime in different SAT solvers and discussing reasons for performance gains and losses. Results show that LCM only boosts performance of parallel SAT solvers on a fraction of SAT instances. More commonly applying LCM decreases performance. Only certain LCM approaches are able to improve the overall performance of parallel SAT solvers.</abstract>
    <parentTitle language="eng">Pragmatics of SAT 2019</parentTitle>
    <identifier type="arxiv">arXiv:1908.01624v1</identifier>
    <identifier type="url">http://www.pragmaticsofsat.org/2019/</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Marc Hartung</author>
    <submitter>Florian Schintke</submitter>
    <author>Florian Schintke</author>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="persons" number="schintke">Schintke, Florian</collection>
    <collection role="projects" number="2016-HPSV">2016-HPSV</collection>
  </doc>
  <doc>
    <id>7334</id>
    <completedYear/>
    <publishedYear>2019</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Scheduling Data Streams for Low Latency and High Throughput on a Cray XC40 Using Libfabric</title>
    <abstract language="eng">Achieving efficient many-to-many communication on a given network topology is a challenging task when many data streams from different sources have to be scattered concurrently to many destinations with low variance in arrival times. In such scenarios, it is critical to saturate but not to congest the bisectional bandwidth of the network topology in order to achieve a good aggregate throughput. When there are many concurrent point-to-point connections, the communication pattern needs to be dynamically scheduled in a fine-grained manner to avoid network congestion (links, switches), overload in the node’s incoming links, and receive buffer overflow. Motivated by the use case of the Compressed Baryonic Matter experiment (CBM), we study the performance and variance of such communication patterns on a Cray XC40 with different routing schemes and scheduling approaches. We present a distributed Data Flow Scheduler (DFS) that reduces the variance of arrival times from all sources at least 30 times and increases the achieved aggregate bandwidth by up to 50%.</abstract>
    <parentTitle language="eng">CUG Conference Proceedings</parentTitle>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="FulltextUrl">https://cug.org/proceedings/cug2019_proceedings/includes/files/pap117s2-file1.pdf</enrichment>
    <author>Farouk Salem</author>
    <submitter>Florian Schintke</submitter>
    <author>Thorsten Schütt</author>
    <author>Florian Schintke</author>
    <author>Alexander Reinefeld</author>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="persons" number="reinefeld">Reinefeld, Alexander</collection>
    <collection role="persons" number="schintke">Schintke, Florian</collection>
    <collection role="persons" number="schuett">Schütt, Thorsten</collection>
    <collection role="projects" number="2015-CBM-FLES-SACK">2015-CBM-FLES-SACK</collection>
  </doc>
  <doc>
    <id>7337</id>
    <completedYear/>
    <publishedYear>2019</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Linearizable State Machine Replication of State-Based CRDTs without Logs</title>
    <abstract language="eng">General solutions of state machine replication have to ensure that all replicas apply the same commands in the same order, even in the presence of failures. Such strict ordering incurs high synchronization costs caused by distributed consensus or by the use of a leader.&#13;
This paper presents a protocol for linearizable state machine replication of conflict-free replicated data types (CRDTs) that neither requires consensus nor a leader. By leveraging the properties of state-based CRDTs - in particular the monotonic growth of a join semilattice - synchronization overhead is greatly reduced. In addition, updates just need a single round trip and modify the state `in-place' without the need for a log. Furthermore, the message size overhead for coordination consists of a single counter per message. While reads in the presence of concurrent updates are not wait-free without a coordinator, we show that more than 97% of reads can be handled in one or two round trips under highly concurrent accesses.&#13;
Our protocol achieves high throughput without auxiliary processes like command log management or leader election. It is well suited for all practical scenarios that need linearizable access on CRDT data on a fine-granular scale.</abstract>
    <parentTitle language="eng">arXiv</parentTitle>
    <identifier type="arxiv">1905.08733v1</identifier>
    <enrichment key="PeerReviewed">no</enrichment>
    <author>Jan Skrzypczak</author>
    <submitter>Jan Skrzypczak</submitter>
    <author>Florian Schintke</author>
    <author>Thorsten Schütt</author>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="persons" number="schintke">Schintke, Florian</collection>
    <collection role="persons" number="schuett">Schütt, Thorsten</collection>
    <collection role="persons" number="skrzypczak">Skrzypczak, Jan</collection>
    <collection role="projects" number="2017-rbrcseq">2017-rbrcseq</collection>
  </doc>
  <doc>
    <id>601</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>deu</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2000-09-27</completedDate>
    <publishedDate>2000-09-27</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="deu">Ermittlung von Programmlaufzeiten anhand von Speicherzugriffen, Microbenchmarks und Simulation vonSpeicherhierarchien</title>
    <abstract language="eng">\\{\bf Zusammenfassung:} 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\ss{} 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 Zugriffssequenz 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.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.</abstract>
    <identifier type="serial">00-33</identifier>
    <identifier type="opus3-id">602</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-6018</identifier>
    <author>Florian Schintke</author>
    <series>
      <title>ZIB-Report</title>
      <number>00-33</number>
    </series>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Cache-Simulator</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Microbenchmarks</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>SMP-System</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Kostenmodell</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Speicherhierarchie</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="ccs" number="C.4">PERFORMANCE OF SYSTEMS</collection>
    <collection role="institutes" number="">ZIB Allgemein</collection>
    <collection role="persons" number="schintke">Schintke, Florian</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/601/ZR-00-33.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/601/ZR-00-33.pdf</file>
  </doc>
  <doc>
    <id>719</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2002-12-20</completedDate>
    <publishedDate>2002-12-20</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">On the Cost of Reliability in Large Data Grids</title>
    <abstract language="eng">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}.</abstract>
    <identifier type="serial">02-52</identifier>
    <identifier type="opus3-id">720</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-7195</identifier>
    <identifier type="doi">10.1023/B:GRID.0000024086.50333.0d</identifier>
    <enrichment key="SourceTitle">Appeared under the title "Modeling Replica Availabilty in Large Data Grids" in: Journal of Grid Computing 1 (2003) pp. 219-227</enrichment>
    <author>Florian Schintke</author>
    <author>Alexander Reinefeld</author>
    <series>
      <title>ZIB-Report</title>
      <number>02-52</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>replication</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>availability</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>reliability</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>distributed catalog</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>data grid</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="ccs" number="C.4">PERFORMANCE OF SYSTEMS</collection>
    <collection role="ccs" number="E.5">FILES (D.4.3, F.2.2, H.2)</collection>
    <collection role="ccs" number="D.4.2">Storage Management</collection>
    <collection role="institutes" number="">ZIB Allgemein</collection>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="persons" number="reinefeld">Reinefeld, Alexander</collection>
    <collection role="persons" number="schintke">Schintke, Florian</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/719/ZR-02-52.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/719/ZR-02-52.pdf</file>
  </doc>
  <doc>
    <id>3428</id>
    <completedYear>2010</completedYear>
    <publishedYear>2010</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>448</pageFirst>
    <pageLast>454</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>IEEE</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Enhanced Paxos Commit for Transactions on DHTs</title>
    <parentTitle language="eng">CCGRID</parentTitle>
    <identifier type="doi">10.1109/CCGRID.2010.41</identifier>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-11448</enrichment>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Florian Schintke</author>
    <author>Alexander Reinefeld</author>
    <author>Seif Haridi</author>
    <author>Thorsten Schütt</author>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="persons" number="reinefeld">Reinefeld, Alexander</collection>
    <collection role="persons" number="schintke">Schintke, Florian</collection>
    <collection role="persons" number="schuett">Schütt, Thorsten</collection>
    <collection role="projects" number="2008-Scalaris">2008-Scalaris</collection>
  </doc>
  <doc>
    <id>3432</id>
    <completedYear>2010</completedYear>
    <publishedYear>2010</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>doctoralthesis</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation>Humboldt-Universität zu Berlin</contributingCorporation>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Management verteilter Daten in Grid- und Peer-to-Peer-Systemen</title>
    <identifier type="url">http://www.dr.hut-verlag.de/978-3-86853-358-3.html</identifier>
    <author>Florian Schintke</author>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="persons" number="schintke">Schintke, Florian</collection>
    <collection role="projects" number="2008-Scalaris">2008-Scalaris</collection>
  </doc>
  <doc>
    <id>3463</id>
    <completedYear>2009</completedYear>
    <publishedYear>2009</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Self-Adaptation in Large-Scale Systems: A Study on Structured Overlays Across Multiple Datacenters</title>
    <parentTitle language="eng">Architectures and Languages for Self-Managing Distributed Systems (SelfMan@SASO)</parentTitle>
    <identifier type="doi">10.1109/SASOW.2010.65</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Thorsten Schütt</author>
    <author>Alexander Reinefeld</author>
    <author>Florian Schintke</author>
    <author>C. Hennig</author>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="persons" number="reinefeld">Reinefeld, Alexander</collection>
    <collection role="persons" number="schintke">Schintke, Florian</collection>
    <collection role="persons" number="schuett">Schütt, Thorsten</collection>
    <collection role="projects" number="2008-Scalaris">2008-Scalaris</collection>
  </doc>
  <doc>
    <id>3471</id>
    <completedYear>2008</completedYear>
    <publishedYear>2008</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Transactional Scalable Distributed Data Store</title>
    <parentTitle language="eng">1st IEEE International Scalable Computing Challenge, co-located with CCGrid’08</parentTitle>
    <author>Thorsten Schütt</author>
    <author>Monika Moser</author>
    <author>Stefan Plantikow</author>
    <author>Florian Schintke</author>
    <author>Alexander Reinefeld</author>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="persons" number="reinefeld">Reinefeld, Alexander</collection>
    <collection role="persons" number="schintke">Schintke, Florian</collection>
    <collection role="persons" number="schuett">Schütt, Thorsten</collection>
    <collection role="projects" number="2008-Scalaris">2008-Scalaris</collection>
  </doc>
  <doc>
    <id>3477</id>
    <completedYear>2008</completedYear>
    <publishedYear>2008</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue>WHP-0004</issue>
    <volume/>
    <type>other</type>
    <publisherName>Institute on Architectural Issues: Scalability, Dependability, Adaptability, CoreGRID - Network of  Excellence</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Grid Architectural Issues: State-of-the-art and Future Trends</title>
    <identifier type="url">http://coregrid.ercim.eu//mambo/images/stories/WhitePapers/whp-0004.pdf</identifier>
    <author>Artur Andrzejak</author>
    <author>Alexander Reinefeld</author>
    <author>Florian Schintke</author>
    <author>Thorsten Schütt</author>
    <author>Carlo Mastroianni</author>
    <author>Paraskevi Fragopoulou</author>
    <author>Derrick Kondo</author>
    <author>Paul Malecot</author>
    <author>Gheorghe Cosmin Silaghi</author>
    <author>Luis Moura Silva</author>
    <author>Paolo Trunfio</author>
    <author>Demetris Zeinalipour-Yazti</author>
    <author>Eugenio Zimeo</author>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="persons" number="reinefeld">Reinefeld, Alexander</collection>
    <collection role="persons" number="schintke">Schintke, Florian</collection>
    <collection role="persons" number="schuett">Schütt, Thorsten</collection>
  </doc>
  <doc>
    <id>3445</id>
    <completedYear>2009</completedYear>
    <publishedYear>2009</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>148</pageFirst>
    <pageLast>159</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>bookpart</type>
    <publisherName>IOS Press</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Scalable, Transactional Data Store for Future Internet Services</title>
    <parentTitle language="eng">Towards the Future Internet - A European Research Perspective</parentTitle>
    <identifier type="doi">10.3233/978-1-60750-007-0-148</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Alexander Reinefeld</author>
    <editor>G. Tselentis</editor>
    <author>Florian Schintke</author>
    <editor>J. Domingue</editor>
    <author>Thorsten Schütt</author>
    <editor>A. Galis</editor>
    <author>Seif Haridi</author>
    <editor>A. Gavras</editor>
    <editor>D. Hausheer</editor>
    <editor>S. Krco</editor>
    <editor>V. Lotz</editor>
    <editor>T. Zahariadis</editor>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="persons" number="reinefeld">Reinefeld, Alexander</collection>
    <collection role="persons" number="schintke">Schintke, Florian</collection>
    <collection role="persons" number="schuett">Schütt, Thorsten</collection>
    <collection role="projects" number="2008-Scalaris">2008-Scalaris</collection>
  </doc>
  <doc>
    <id>3455</id>
    <completedYear>2009</completedYear>
    <publishedYear>2009</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>147</pageFirst>
    <pageLast>150</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Gossip-based Topology Inference for Efficient Overlay Mapping on Data Centers</title>
    <parentTitle language="eng">Peer-to-Peer Computing</parentTitle>
    <identifier type="doi">10.1109/P2P.2009.5284553</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Thorsten Schütt</author>
    <author>Alexander Reinefeld</author>
    <author>Florian Schintke</author>
    <author>Marie Hoffmann</author>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="persons" number="reinefeld">Reinefeld, Alexander</collection>
    <collection role="persons" number="schintke">Schintke, Florian</collection>
    <collection role="persons" number="schuett">Schütt, Thorsten</collection>
    <collection role="projects" number="2008-Scalaris">2008-Scalaris</collection>
  </doc>
  <doc>
    <id>3489</id>
    <completedYear>2008</completedYear>
    <publishedYear>2008</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>337</pageFirst>
    <pageLast>349</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Transactions and Concurrency Control for Peer-to-Peer-Wikis: An Evaluation</title>
    <parentTitle language="eng">Making Grids Work</parentTitle>
    <identifier type="doi">10.1007/978-0-387-78448-9_27</identifier>
    <author>Stefan Plantikow</author>
    <editor>Marco Danelutto</editor>
    <author>Alexander Reinefeld</author>
    <editor>Paraskevi Fragopoulou</editor>
    <author>Florian Schintke</author>
    <editor>Vladimir Getov</editor>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="persons" number="reinefeld">Reinefeld, Alexander</collection>
    <collection role="persons" number="schintke">Schintke, Florian</collection>
    <collection role="projects" number="2008-Scalaris">2008-Scalaris</collection>
  </doc>
</export-example>
