<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>1153</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2009-10-27</completedDate>
    <publishedDate>2009-10-27</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Transactional DHT Algorithms</title>
    <abstract language="eng">We present a framework for transactional data access on data stored in a DHT. It allows to atomically read and write items and to run distributed transactions consisting of a sequence of read and write operations on the items. Items are symmetrically replicated in order to achieve durability of data stored in the SON. To provide availability of items despite the unavailability of some replicas, operations on items are quorum-based. They make progress as long as a majority of replicas can be accessed. Our framework processes transactions optimistically with an atomic commit protocol that is based on Paxos atomic commit. We present algorithms for the whole framework with an event based notation. Additionally we discuss the problem of lookup inconsistencies and its implications on the one-copy serializability property of the transaction processing in our framework.</abstract>
    <identifier type="serial">09-34</identifier>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="opus3-id">1210</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-11532</identifier>
    <author>Monika Moser</author>
    <submitter>unknown unknown</submitter>
    <author>Seif Haridi</author>
    <author>Tallat Shafaat</author>
    <author>Thorsten Schütt</author>
    <author>Mikael Högqvist</author>
    <author>Alexander Reinefeld</author>
    <series>
      <title>ZIB-Report</title>
      <number>09-34</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Distributed System</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>DHT</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Paxos</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Algorithms</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Storage</value>
    </subject>
    <collection role="ddc" number="004">Datenverarbeitung; Informatik</collection>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="persons" number="reinefeld">Reinefeld, Alexander</collection>
    <collection role="persons" number="schuett">Schütt, Thorsten</collection>
    <collection role="projects" number="2008-Scalaris">2008-Scalaris</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1153/ZR_09_34.pdf</file>
  </doc>
  <doc>
    <id>1144</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2009-09-07</completedDate>
    <publishedDate>2009-09-07</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Enhanced Paxos Commit for Transactions on DHTs</title>
    <abstract language="eng">Key/value stores which are built on structured overlay networks often lack support for atomic transactions and strong data consistency among replicas. This is unfortunate, because consistency guarantees and transactions would allow a wide range of additional application domains to benefit from the inherent scalability and fault-tolerance of DHTs. The Scalaris key/value store supports strong data consistency and atomic transactions. It uses an enhanced Paxos Commit protocol with only four communication steps rather than six. This improvement was possible by exploiting information from the replica distribution in the DHT. Scalaris enables implementation of more reliable and scalable infrastructure for collaborative Web services that require strong consistency and atomic changes across multiple items.</abstract>
    <identifier type="serial">09-28</identifier>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="opus3-id">1193</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-11448</identifier>
    <author>Florian Schintke</author>
    <submitter>unknown unknown</submitter>
    <author>Alexander Reinefeld</author>
    <author>Seif Haridi</author>
    <author>Thorsten Schütt</author>
    <series>
      <title>ZIB-Report</title>
      <number>09-28</number>
    </series>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Paxos</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Transaktionen</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>DHT</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>strenge Konsistenz</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Paxos</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>transactions</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>DHT</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>strong consistency</value>
    </subject>
    <collection role="ddc" number="004">Datenverarbeitung; Informatik</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>
    <collection role="persons" number="schuett">Schütt, Thorsten</collection>
    <collection role="projects" number="2008-Scalaris">2008-Scalaris</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1144/ZR_09_28.pdf</file>
  </doc>
  <doc>
    <id>4207</id>
    <completedYear>2013</completedYear>
    <publishedYear>2013</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">Building Large Compressed PDBs for the Sliding Tile Puzzle</title>
    <parentTitle language="eng">Workshop on Computer Games</parentTitle>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-18095</enrichment>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Robert Döbbelin</author>
    <author>Thorsten Schütt</author>
    <author>Alexander Reinefeld</author>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="institutes" number="">Scalable Algorithms</collection>
    <collection role="persons" number="reinefeld">Reinefeld, Alexander</collection>
    <collection role="persons" number="schuett">Schütt, Thorsten</collection>
    <collection role="projects" number="2008-MR-Search">2008-MR-Search</collection>
  </doc>
  <doc>
    <id>6832</id>
    <completedYear/>
    <publishedYear>2018</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>130</pageFirst>
    <pageLast>131</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Data-flow scheduling for a scalable FLESnet</title>
    <parentTitle language="eng">CBM Progress Report 2017</parentTitle>
    <identifier type="isbn">978-3-9815227-5-4</identifier>
    <identifier type="doi">10.15120/GSI-2018-00485</identifier>
    <enrichment key="PeerReviewed">no</enrichment>
    <author>Farouk Salem</author>
    <submitter>Florian Schintke</submitter>
    <author>Florian Schintke</author>
    <author>Thorsten Schütt</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>7025</id>
    <completedYear/>
    <publishedYear>2018</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>44:1</pageFirst>
    <pageLast>44:10</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Checkpoint Scheduling for Shared Usage of Burst-Buffers in Supercomputers</title>
    <abstract language="eng">User-defined and system-level checkpointing have contrary properties. While user-defined checkpoints are smaller and simpler to recover, system-level checkpointing better knows the global system's state and parameters like the expected mean time to failure (MTTF) per node. Both approaches lead to non-optimal checkpoint time, intervals, sizes, or I/O bandwidth when concurrent checkpoints conflict and compete for it.&#13;
&#13;
We combine user-defined and system-level checkpointing to exploit the benefits and avoid the drawbacks of each other. Thus, applications frequently offer to create checkpoints. The system accepts such offers according to the current status and implied costs to recalculate from the last checkpoint or denies them, i.e., immediately lets continue the application without checkpoint creation. To support this approach, we develop economic models for multi-application checkpointing on shared I/O resources that are dedicated for checkpointing (e.g. burst-buffers) by defining an appropriate goal function and solving a global optimization problem.&#13;
&#13;
Using our models, the checkpoints of applications on a supercomputer are scheduled to effectively use the available I/O bandwidth and minimize the failure overhead (checkpoint creations plus recalculations). Our simulations show an overall reduction in failure overhead of all nodes of up to 30% for a typical supercomputer workload (HLRN). We can also derive the most cost effective burst-buffer bandwidth for a given node's MTTF and application workload.</abstract>
    <parentTitle language="eng">Proceedings of the 47th International Conference on Parallel Processing Companion; SRMPDS 2018: The 14th International Workshop on Scheduling and Resource Management for Parallel and Distributed Systems</parentTitle>
    <identifier type="doi">10.1145/3229710.3229755</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Masoud Gholami</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="projects" number="2013-FFMK">2013-FFMK</collection>
  </doc>
  <doc>
    <id>7068</id>
    <completedYear/>
    <publishedYear>2018</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>poster</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Modeling Checkpoint Schedules for Concurrent HPC Applications</title>
    <parentTitle language="eng">CoSaS 2018  International Symposium on Computational Science at Scale</parentTitle>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Masoud Gholami</author>
    <submitter>Florian Schintke</submitter>
    <author>Florian Schintke</author>
    <author>Thorsten Schütt</author>
    <author>Alexander Reinefeld</author>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="institutes" number="">Distributed Data Management</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="2013-FFMK">2013-FFMK</collection>
  </doc>
  <doc>
    <id>7077</id>
    <completedYear/>
    <publishedYear>2018</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>89</pageFirst>
    <pageLast>102</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">From Application to Disk: Tracing I/O Through the Big Data Stack</title>
    <abstract language="eng">Typical applications in data science consume, process and produce large amounts of data, making disk I/O one of the dominating — and thus worthwhile optimizing — factors of their overall performance. Distributed processing frameworks, such as Hadoop, Flink and Spark, hide a lot of complexity from the programmer when they parallelize these applications across a compute cluster. This exacerbates reasoning about I/O of both the application and the framework, through the distributed file system, such as HDFS, down to the local file systems.&#13;
We present SFS (Statistics File System), a modular framework to trace each I/O request issued by the application and any JVM-based big data framework involved, mapping these requests to actual disk I/O.&#13;
This allows detection of inefficient I/O patterns, both by the applications and the underlying frameworks, and builds the basis for improving I/O scheduling in the big data software stack.</abstract>
    <parentTitle language="eng">High Performance Computing ISC High Performance 2018 International Workshops, Frankfurt/Main, Germany, June 24 - 28, 2018, Revised Selected Papers, Workshop on Performance and Scalability of Storage Systems (WOPSSS)</parentTitle>
    <identifier type="doi">10.1007/978-3-030-02465-9_6</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="AcceptedDate">2018-07-16</enrichment>
    <author>Robert Schmidtke</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="projects" number="2006-XtreemFS">2006-XtreemFS</collection>
    <collection role="projects" number="2014-BBDC">2014-BBDC</collection>
    <collection role="projects" number="2014-BBDC-WP12">2014-BBDC-WP12</collection>
  </doc>
  <doc>
    <id>7699</id>
    <completedYear/>
    <publishedYear>2019</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>483</pageFirst>
    <pageLast>516</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>Springer</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">FFMK: A Fast and Fault-Tolerant Microkernel-Based System for Exascale Computing</title>
    <parentTitle language="eng">Software for Exascale Computing - SPPEXA 2016-2019</parentTitle>
    <identifier type="doi">10.1007/978-3-030-47956-5_16</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="AcceptedDate">2019-10-07</enrichment>
    <author>Carsten Weinhold</author>
    <submitter>Florian Schintke</submitter>
    <author>Adam Lackorzynski</author>
    <author>Jan Bierbaum</author>
    <author>Martin Küttler</author>
    <author>Maksym Planeta</author>
    <author>Hannes Weisbach</author>
    <author>Matthias Hille</author>
    <author>Hermann Härtig</author>
    <author>Alexander Margolin</author>
    <author>Dror Sharf</author>
    <author>Ely Levy</author>
    <author>Pavel Gak</author>
    <author>Amnon Barak</author>
    <author>Masoud Gholami</author>
    <author>Florian Schintke</author>
    <author>Thorsten Schütt</author>
    <author>Alexander Reinefeld</author>
    <author>Matthias Lieber</author>
    <author>Wolfgang Nagel</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="2013-FFMK">2013-FFMK</collection>
  </doc>
  <doc>
    <id>1809</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2013-04-22</completedDate>
    <publishedDate>2013-04-22</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Building Large Compressed PDBs for the Sliding Tile Puzzle</title>
    <abstract language="eng">The performance of heuristic search algorithms depends crucially on the effectiveness of the heuristic. A pattern database (PDB) is a powerful heuristic in the form of a pre-computed lookup table. Larger PDBs provide better bounds and thus allow more cut-offs in the search process. Today, the largest PDB for the 24-puzzle is a 6-6-6-6 PDB with a size of 486 MB.&#13;
&#13;
We created 8-8-8, 9-8-7 and 9-9-6 PDBs that are three orders of magnitude larger (up to 1.4 TB) than the 6-6-6-6 PDB. We show how to compute such large PDBs and we present statistical and empirical data on their efficiency. The largest single PDB gives on average an 8-fold improvement over the 6-6-6-6 PDB. Combining several large&#13;
PDBs gives on average an 12-fold improvement.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-18095</identifier>
    <enrichment key="SourceTitle">Appeared in: Workshop on Computer Games, 2013</enrichment>
    <author>Robert Döbbelin</author>
    <submitter>Robert Döbbelin</submitter>
    <author>Thorsten Schütt</author>
    <author>Alexander Reinefeld</author>
    <series>
      <title>ZIB-Report</title>
      <number>13-21</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>heuristic search</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>pattern databases</value>
    </subject>
    <collection role="ccs" number="">Graphs and networks (REVISED)</collection>
    <collection role="ccs" number="">Heuristic methods</collection>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="persons" number="reinefeld">Reinefeld, Alexander</collection>
    <collection role="persons" number="schuett">Schütt, Thorsten</collection>
    <collection role="projects" number="2008-MR-Search">2008-MR-Search</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1809/ZR-13-21.pdf</file>
  </doc>
  <doc>
    <id>3422</id>
    <completedYear>2011</completedYear>
    <publishedYear>2011</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>382</pageFirst>
    <pageLast>391</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>0</volume>
    <type>article</type>
    <publisherName>IEEE Computer Society</publisherName>
    <publisherPlace>Los Alamitos, CA, USA</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">The Benefits of Estimated Global Information in DHT Load Balancing</title>
    <parentTitle language="eng">Cluster Computing and the Grid, IEEE International Symposium on</parentTitle>
    <identifier type="doi">10.1109/CCGrid.2011.11</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Nico Kruber</author>
    <author>Mikael Högqvist</author>
    <author>Thorsten Schütt</author>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="persons" number="schuett">Schütt, Thorsten</collection>
    <collection role="projects" number="2008-Scalaris">2008-Scalaris</collection>
    <collection role="projects" number="2010-4CaaST">2010-4CaaST</collection>
    <collection role="projects" number="2010-Contrail">2010-Contrail</collection>
  </doc>
  <doc>
    <id>3399</id>
    <completedYear>2012</completedYear>
    <publishedYear>2012</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>48</pageFirst>
    <pageLast>54</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>IEEE Computer Society</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">An Analysis of SMP Memory Allocators</title>
    <parentTitle language="eng">Proceedings of the 41st International Conference on Parallel Processing Workshops (Fifth International Workshop on Parallel Programming Models and Systems Software for High-End Computing (P2S2))</parentTitle>
    <identifier type="doi">10.1109/ICPPW.2012.10</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Robert Döbbelin</author>
    <author>Thorsten Schütt</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="schuett">Schütt, Thorsten</collection>
    <collection role="projects" number="2008-MR-Search">2008-MR-Search</collection>
  </doc>
  <doc>
    <id>3376</id>
    <completedYear>2013</completedYear>
    <publishedYear>2013</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">Forward Perimeter Search with Controlled Use of Memory</title>
    <parentTitle language="eng">International Joint Conference on Artificial Intelligence, IJCAI-13, Beijing</parentTitle>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="FulltextUrl">http://ijcai.org/papers13/Papers/IJCAI13-104.pdf</enrichment>
    <author>Thorsten Schütt</author>
    <author>Robert Döbbelin</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="schuett">Schütt, Thorsten</collection>
    <collection role="projects" number="2008-MR-Search">2008-MR-Search</collection>
  </doc>
  <doc>
    <id>3377</id>
    <completedYear/>
    <publishedYear>2011</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>40</pageFirst>
    <pageLast>54</pageLast>
    <pageNumber/>
    <edition/>
    <issue>1</issue>
    <volume>25</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">MR-search: massively parallel heuristic search</title>
    <parentTitle language="eng">Concurrency and Computation: Practice and Experience</parentTitle>
    <identifier type="doi">10.1002/cpe.1833</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Thorsten Schütt</author>
    <author>Alexander Reinefeld</author>
    <author>Robert Döbbelin</author>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="persons" number="reinefeld">Reinefeld, Alexander</collection>
    <collection role="persons" number="schuett">Schütt, Thorsten</collection>
    <collection role="projects" number="2008-MR-Search">2008-MR-Search</collection>
  </doc>
  <doc>
    <id>7489</id>
    <completedYear/>
    <publishedYear>2019</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>149</pageFirst>
    <pageLast>150</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Improving the throughput of a scalable FLESnet using the Data-Flow Scheduler</title>
    <parentTitle language="eng">CBM Progress Report 2018</parentTitle>
    <identifier type="doi">10.15120/GSI-2019-01018</identifier>
    <identifier type="isbn">978-3-9815227-6-1</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>Thorsten Schütt</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>7540</id>
    <completedYear/>
    <publishedYear>2019</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>386</pageFirst>
    <pageLast>393</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Pinpoint Data Races via Testing and Classification</title>
    <parentTitle language="eng">2019 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW); 3rd International Workshop on Software Faults (IWSF 2019)</parentTitle>
    <identifier type="doi">10.1109/ISSREW.2019.00100</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="AcceptedDate">2019-09-04</enrichment>
    <author>Marc Hartung</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="projects" number="2016-HPSV">2016-HPSV</collection>
  </doc>
  <doc>
    <id>7498</id>
    <completedYear/>
    <publishedYear>2020</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1</pageFirst>
    <pageLast>14</pageLast>
    <pageNumber>14</pageNumber>
    <edition/>
    <issue>20</issue>
    <volume>32</volume>
    <type>article</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>
    <parentTitle language="eng">Concurrency and Computation Practice and Experience</parentTitle>
    <identifier type="doi">10.1002/cpe.5563</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="AcceptedDate">2019-10-04</enrichment>
    <enrichment key="FulltextUrl">https://onlinelibrary.wiley.com/doi/epdf/10.1002/cpe.5563</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Farouk Salem</author>
    <submitter>Florian Schintke</submitter>
    <author>Florian Schintke</author>
    <author>Thorsten Schütt</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>7813</id>
    <completedYear/>
    <publishedYear>2020</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>2392</pageFirst>
    <pageLast>2405</pageLast>
    <pageNumber/>
    <edition/>
    <issue>10</issue>
    <volume>31</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">RMWPaxos: Fault-Tolerant In-Place Consensus Sequences</title>
    <parentTitle language="eng">IEEE Transactions on Parallel and Distributed Systems</parentTitle>
    <identifier type="doi">10.1109/TPDS.2020.2981891</identifier>
    <identifier type="arxiv">2001.03362</identifier>
    <identifier type="issn">1045-9219</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <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>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>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>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>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>3459</id>
    <completedYear>2009</completedYear>
    <publishedYear>2009</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>323</pageFirst>
    <pageLast>336</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>5976</volume>
    <type>conferenceobject</type>
    <publisherName>Springer</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Out-of-Core Parallel Frontier Search with MapReduce</title>
    <parentTitle language="eng">HPCS</parentTitle>
    <identifier type="doi">10.1007/978-3-642-12659-8_24</identifier>
    <enrichment key="Series">Lecture Notes in Computer Science</enrichment>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Alexander Reinefeld</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="schuett">Schütt, Thorsten</collection>
    <collection role="projects" number="2008-MR-Search">2008-MR-Search</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>3478</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">Key-Based Consistency and Availability in Structured Overlay Networks</title>
    <parentTitle language="eng">International ICST Conference on Scalable Information Systems</parentTitle>
    <author>Tallat Shafaat</author>
    <author>Monika Moser</author>
    <author>Ali Ghodsi</author>
    <author>Thorsten Schütt</author>
    <author>Seif Haridi</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="schuett">Schütt, Thorsten</collection>
    <collection role="projects" number="2008-Scalaris">2008-Scalaris</collection>
  </doc>
  <doc>
    <id>3439</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">Range queries in distributed hash tables</title>
    <identifier type="url">http://www.dr.hut-verlag.de/978-3-86853-370-5.html</identifier>
    <author>Thorsten Schütt</author>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="persons" number="schuett">Schütt, Thorsten</collection>
    <collection role="projects" number="2008-Scalaris">2008-Scalaris</collection>
  </doc>
  <doc>
    <id>3443</id>
    <completedYear>2010</completedYear>
    <publishedYear>2010</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>803</pageFirst>
    <pageLast>809</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>ACM</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Very large pattern databases for heuristic search</title>
    <parentTitle language="eng">HPDC</parentTitle>
    <identifier type="doi">10.1145/1851476.1851592</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Alexander Reinefeld</author>
    <editor>Salim Hariri</editor>
    <author>Thorsten Schütt</author>
    <editor>Kate Keahey</editor>
    <author>Robert Döbbelin</author>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="persons" number="reinefeld">Reinefeld, Alexander</collection>
    <collection role="persons" number="schuett">Schütt, Thorsten</collection>
    <collection role="projects" number="2008-MR-Search">2008-MR-Search</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>3490</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">Using Global Information for Load Balancing in DHTs</title>
    <parentTitle language="eng">Workshop on Decentralized Self Management for Grids, P2P, and User Communities</parentTitle>
    <author>Mikael Högqvist</author>
    <author>Seif Haridi</author>
    <author>Nico Kruber</author>
    <author>Alexander Reinefeld</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="schuett">Schütt, Thorsten</collection>
    <collection role="projects" number="2008-Scalaris">2008-Scalaris</collection>
  </doc>
  <doc>
    <id>3495</id>
    <completedYear>2007</completedYear>
    <publishedYear>2007</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>503</pageFirst>
    <pageLast>513</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>4641</volume>
    <type>conferenceobject</type>
    <publisherName>Springer</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Structured Overlay for Multi-dimensional Range Queries</title>
    <parentTitle language="eng">Euro-Par Conference</parentTitle>
    <identifier type="url">http://dx.doi.org/10.1007/978-3-540-74466-5_54</identifier>
    <identifier type="doi">10.1007/978-3-540-74466-5_54</identifier>
    <enrichment key="Series">LNCS</enrichment>
    <author>Thorsten Schütt</author>
    <editor>Anne-Marie Kermarrec</editor>
    <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>3502</id>
    <completedYear>2007</completedYear>
    <publishedYear>2007</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>other</type>
    <publisherName>United States Patent Application Publication No. US 2007/0165619 A1</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Device and method for retrieving / storing electronic data in a system with a plurality of data processing units</title>
    <author>Alexander Reinefeld</author>
    <author>Florian Schintke</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>3516</id>
    <completedYear>2007</completedYear>
    <publishedYear>2007</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>other</type>
    <publisherName>Europäisches Patent EP 1 744 257 A1</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Vorrichtung und Verfahren zum Abrufen / Speichern von elektronischen Daten in einem System mit mehreren Datenverarbeitungseinheiten</title>
    <author>Alexander Reinefeld</author>
    <author>Florian Schintke</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>3517</id>
    <completedYear>2007</completedYear>
    <publishedYear>2007</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>other</type>
    <publisherName>Europäische Patentanmeldung Nr. 06012030.0 vom 12.06.2006, Patent Nr: 1868114</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Vorrichtung und Verfahren zum Speichern / Abrufen von Objekten mit mehrdimensional adressierten, elektronischen Daten</title>
    <author>Alexander Reinefeld</author>
    <author>Florian Schintke</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>3479</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">On Consistency of Data in Structured Overlay Networks</title>
    <parentTitle language="eng">Coregrid Integration Workshop</parentTitle>
    <author>Tallat Shafaat</author>
    <author>Monika Moser</author>
    <author>Ali Ghodsi</author>
    <author>Thorsten Schütt</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="schuett">Schütt, Thorsten</collection>
    <collection role="projects" number="2008-Scalaris">2008-Scalaris</collection>
  </doc>
  <doc>
    <id>3481</id>
    <completedYear>2008</completedYear>
    <publishedYear>2008</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>280</pageFirst>
    <pageLast>291</pageLast>
    <pageNumber/>
    <edition/>
    <issue>2</issue>
    <volume>31</volume>
    <type>article</type>
    <publisherName>Elsevier</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Range Queries on structured overlay networks</title>
    <parentTitle language="eng">Computer Communications</parentTitle>
    <identifier type="doi">10.1016/j.comcom.2007.08.027</identifier>
    <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="2008-Scalaris">2008-Scalaris</collection>
  </doc>
  <doc>
    <id>3482</id>
    <completedYear>2008</completedYear>
    <publishedYear>2008</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>41</pageFirst>
    <pageLast>47</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Scalaris: Reliable Transactional P2P Key/Value</title>
    <parentTitle language="eng">ERLANG '08: Proceedings of the 7th ACM SIGPLAN workshop on ERLANG</parentTitle>
    <identifier type="doi">10.1145/1411273.1411280</identifier>
    <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="2008-Scalaris">2008-Scalaris</collection>
  </doc>
  <doc>
    <id>3485</id>
    <completedYear>2008</completedYear>
    <publishedYear>2008</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace>Chicago, IL, USA</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Sloppy Management of Structured P2P Services</title>
    <parentTitle language="eng">Proceedings of the 3$^rd$ International Workshop on Hot Topics in Autonomic Computing (HotAC III), co-located with IEEE ICAC’08</parentTitle>
    <author>Paolo Costa</author>
    <author>Guillaume Pierre</author>
    <author>Alexander Reinefeld</author>
    <author>Thorsten Schütt</author>
    <author>Maarten van Steen</author>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="persons" number="reinefeld">Reinefeld, Alexander</collection>
    <collection role="persons" number="schuett">Schütt, Thorsten</collection>
  </doc>
  <doc>
    <id>3550</id>
    <completedYear>2005</completedYear>
    <publishedYear>2005</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>534</pageFirst>
    <pageLast>550</pageLast>
    <pageNumber/>
    <edition/>
    <issue>3</issue>
    <volume>93</volume>
    <type>article</type>
    <publisherName>IEEE Computer Society Press</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">The Grid Application Toolkit: Toward Generic and Easy Appliction Programming Interfaces for the Grid</title>
    <parentTitle language="eng">Procceedings of the IEEE</parentTitle>
    <identifier type="doi">10.1109/JPROC.2004.842755</identifier>
    <author>Gabrielle Allen</author>
    <author>K. Davis</author>
    <author>Tom Goodale</author>
    <author>Andrei Hutanu</author>
    <author>Hartmut Kaiser</author>
    <author>Thilo Kielmann</author>
    <author>Andre Merzky</author>
    <author>R. Nieuwpoort</author>
    <author>Alexander Reinefeld</author>
    <author>Florian Schintke</author>
    <author>Thorsten Schütt</author>
    <author>Edward Seidel</author>
    <author>Brygg Ullmer</author>
    <collection role="institutes" number="vis">Visual Data Analysis</collection>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="institutes" number="visalgo">Visual Data Analysis in Science and Engineering</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="institutes" number="VDcC">Visual and Data-centric Computing</collection>
  </doc>
  <doc>
    <id>3564</id>
    <completedYear>2004</completedYear>
    <publishedYear>2004</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>482</pageFirst>
    <pageLast>489</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>IEEE Computer Society</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Remote partial file access using compact pattern descriptions</title>
    <parentTitle language="eng">4th IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGrid 2004), April 19-22, 2004, Chicago, Illinois, USA</parentTitle>
    <identifier type="doi">10.1109/CCGrid.2004.1336604</identifier>
    <author>Thorsten Schütt</author>
    <author>André Merzky</author>
    <author>Andrei Hutanu</author>
    <author>Florian Schintke</author>
    <collection role="institutes" number="vis">Visual Data Analysis</collection>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="institutes" number="visalgo">Visual Data Analysis in Science and Engineering</collection>
    <collection role="persons" number="schintke">Schintke, Florian</collection>
    <collection role="persons" number="schuett">Schütt, Thorsten</collection>
    <collection role="institutes" number="VDcC">Visual and Data-centric Computing</collection>
  </doc>
  <doc>
    <id>3565</id>
    <completedYear>2004</completedYear>
    <publishedYear>2004</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>30</pageFirst>
    <pageLast>60</pageLast>
    <pageNumber/>
    <edition/>
    <issue>chapter 2</issue>
    <volume>6</volume>
    <type>bookpart</type>
    <publisherName>World Scientific</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Scalable and Self-Optimizing Data Grids</title>
    <parentTitle language="eng">Annual Review of Scalable Computing</parentTitle>
    <identifier type="doi">10.1142/9789812794727_0002</identifier>
    <author>Alexander Reinefeld</author>
    <author>Florian Schintke</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>
  </doc>
  <doc>
    <id>3568</id>
    <completedYear>2003</completedYear>
    <publishedYear>2003</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>689</pageFirst>
    <pageLast>693</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>IEEE Computer Society</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Framework for Self-Optimizing Grids Using P2P Components</title>
    <parentTitle language="eng">14th International Workshop on Database and Expert Systems Applications (DEXA’03), September 1-5, 2003, Prague, Czech Republic</parentTitle>
    <identifier type="doi">10.1109/DEXA.2003.1232101</identifier>
    <author>Florian Schintke</author>
    <author>Thorsten Schütt</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>
  </doc>
  <doc>
    <id>3534</id>
    <completedYear>2006</completedYear>
    <publishedYear>2006</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>8</pageNumber>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>IEEE Computer Society</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Structured Overlay without Consistent Hashing: Empirical Results</title>
    <parentTitle language="eng">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</parentTitle>
    <identifier type="url">http://doi.ieeecomputersociety.org/10.1109/CCGRID.2006.175</identifier>
    <identifier type="doi">10.1109/CCGRID.2006.175</identifier>
    <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="2008-Scalaris">2008-Scalaris</collection>
  </doc>
  <doc>
    <id>3529</id>
    <completedYear>2006</completedYear>
    <publishedYear>2006</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>29</pageFirst>
    <pageLast>46</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>Springer</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">On Adaptability in Grid Systems</title>
    <parentTitle language="eng">Future Generation Grids: Proceedings of the Workshop on Future Generation Grids, November 1-5, 2004, Dagstuhl, Germany</parentTitle>
    <identifier type="doi">10.1007/978-0-387-29445-2_2</identifier>
    <author>Artur Andrzejak</author>
    <editor>Vladimir Getov</editor>
    <author>Alexander Reinefeld</author>
    <editor>Domenico Laforenza</editor>
    <author>Florian Schintke</author>
    <editor>Alexander Reinefeld</editor>
    <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>
  </doc>
  <doc>
    <id>3573</id>
    <completedYear>2003</completedYear>
    <publishedYear>2003</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>274</pageFirst>
    <pageLast>283</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>2657</volume>
    <type>conferenceobject</type>
    <publisherName>Springer</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Efficient Synchronization of Replicated Data in Distributed Systems</title>
    <parentTitle language="eng">Computational Science - ICCS 2003, International Conference, Melbourne, Australia and St. Petersburg, Russia, June 2-4, 2003. Proceedings, Part I</parentTitle>
    <identifier type="doi">10.1007/3-540-44860-8_28</identifier>
    <enrichment key="Series">Lecture Notes in Computer Science</enrichment>
    <author>Thorsten Schütt</author>
    <editor>Peter Sloot</editor>
    <author>Florian Schintke</author>
    <editor>David Abramson</editor>
    <author>Alexander Reinefeld</author>
    <editor>Alexander Bogdanov</editor>
    <editor>Jack Dongarra</editor>
    <editor>Albert Zomaya</editor>
    <editor>Yuri Gorbachev</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>
  </doc>
  <doc>
    <id>5513</id>
    <completedYear/>
    <publishedYear>2015</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">DataWarp: First Experiences</title>
    <parentTitle language="eng">Cray User Group</parentTitle>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Stefan Andersson</author>
    <submitter>Florian Schintke</submitter>
    <author>Stephen Sachs</author>
    <author>Christian Tuma</author>
    <author>Thorsten Schütt</author>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="persons" number="schuett">Schütt, Thorsten</collection>
    <collection role="persons" number="tuma">Tuma, Christian</collection>
    <collection role="projects" number="2013-Many-Core-HPC">2013-Many-Core-HPC</collection>
  </doc>
  <doc>
    <id>5514</id>
    <completedYear/>
    <publishedYear>2015</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">Application Performance on a Cray XC30 Evaluation System with Xeon Phi Coprocessors at HLRN-III</title>
    <parentTitle language="eng">Cray User Group</parentTitle>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Florian Wende</author>
    <submitter>Florian Schintke</submitter>
    <author>Matthias Noack</author>
    <author>Thorsten Schütt</author>
    <author>Stephen Sachs</author>
    <author>Thomas Steinke</author>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="persons" number="schuett">Schütt, Thorsten</collection>
    <collection role="persons" number="steinke">Steinke, Thomas</collection>
    <collection role="projects" number="2013-Many-Core-HPC">2013-Many-Core-HPC</collection>
  </doc>
  <doc>
    <id>5155</id>
    <completedYear/>
    <publishedYear>2013</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>879</pageFirst>
    <pageLast>889</pageLast>
    <pageNumber/>
    <edition/>
    <issue>12</issue>
    <volume>39</volume>
    <type>article</type>
    <publisherName>Elsevier</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Analyzing the performance of SMP memory allocators with iterative MapReduce applications</title>
    <parentTitle language="eng">Parallel Computing</parentTitle>
    <identifier type="doi">10.1016/j.parco.2013.09.007</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Alexander Reinefeld</author>
    <submitter>Florian Schintke</submitter>
    <author>Thorsten Schütt</author>
    <author>Robert Döbbelin</author>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="persons" number="reinefeld">Reinefeld, Alexander</collection>
    <collection role="persons" number="schuett">Schütt, Thorsten</collection>
    <collection role="projects" number="2008-MR-Search">2008-MR-Search</collection>
  </doc>
  <doc>
    <id>6294</id>
    <completedYear/>
    <publishedYear>2017</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>159</pageFirst>
    <pageLast>160</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Supporting various interconnects in FLESnet using Libfabric</title>
    <parentTitle language="eng">CBM Progress Report 2016</parentTitle>
    <identifier type="isbn">978-3-9815227-4-7</identifier>
    <identifier type="url">https://repository.gsi.de/record/201318</identifier>
    <enrichment key="PeerReviewed">no</enrichment>
    <author>Farouk Salem</author>
    <submitter>Florian Schintke</submitter>
    <author>Florian Schintke</author>
    <author>Thorsten Schütt</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>6435</id>
    <completedYear/>
    <publishedYear>2017</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>323</pageFirst>
    <pageLast>351</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>bookpart</type>
    <publisherName>Morgan Kaufmann</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">The HARNESS Platform: A Hardware- and Network-Enhanced Software System for Cloud Computing</title>
    <parentTitle language="eng">Software Architecture for Big Data and the Cloud</parentTitle>
    <identifier type="isbn">9780128054673</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Jose Coutinho</author>
    <submitter>Florian Schintke</submitter>
    <author>Mark Stillwell</author>
    <author>Katerina Argyraki</author>
    <author>George Ioannidis</author>
    <author>Anca Iordache</author>
    <author>Christoph Kleineweber</author>
    <author>Alexandros Koliousis</author>
    <author>John McGlone</author>
    <author>Guillaume Pierre</author>
    <author>Carmelo Ragusa</author>
    <author>Peter Sanders</author>
    <author>Thorsten Schütt</author>
    <author>Teng Yu</author>
    <author>Alexander Wolf</author>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="persons" number="schuett">Schütt, Thorsten</collection>
    <collection role="projects" number="2012-Harness">2012-Harness</collection>
  </doc>
  <doc>
    <id>5087</id>
    <completedYear/>
    <publishedYear>2014</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>19</pageFirst>
    <pageLast>26</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">QoS-aware Storage Virtualization for Cloud File Systems</title>
    <parentTitle language="eng">Proceedings of the 1st ACM International Workshop on Programmable File Systems</parentTitle>
    <identifier type="doi">10.1145/2603941.2603944</identifier>
    <enrichment key="Series">PFSW '14</enrichment>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Christoph Kleineweber</author>
    <submitter>Florian Schintke</submitter>
    <author>Alexander Reinefeld</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="schuett">Schütt, Thorsten</collection>
    <collection role="projects" number="2006-XtreemFS">2006-XtreemFS</collection>
    <collection role="projects" number="2012-Harness">2012-Harness</collection>
    <collection role="projects" number="2013-FFMK">2013-FFMK</collection>
  </doc>
  <doc>
    <id>5796</id>
    <completedYear/>
    <publishedYear>2016</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">FFMK: A Fast and Fault-tolerant Microkernel-based System for Exascale Computing</title>
    <parentTitle language="eng">SPPEXA Symposium 2016</parentTitle>
    <identifier type="doi">10.1007/978-3-319-40528-5_18</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Carsten Weinhold</author>
    <submitter>Florian Schintke</submitter>
    <author>Adam Lackorzynski</author>
    <author>Jan Bierbaum</author>
    <author>Martin Küttler</author>
    <author>Maksym Planeta</author>
    <author>Hermann Härtig</author>
    <author>Amnon Shiloh</author>
    <author>Ely Levy</author>
    <author>Tal Ben-Nun</author>
    <author>Amnon Barak</author>
    <author>Thomas Steinke</author>
    <author>Thorsten Schütt</author>
    <author>Jan Fajerski</author>
    <author>Alexander Reinefeld</author>
    <author>Matthias Lieber</author>
    <author>Wolfgang Nagel</author>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="persons" number="reinefeld">Reinefeld, Alexander</collection>
    <collection role="persons" number="schuett">Schütt, Thorsten</collection>
    <collection role="persons" number="steinke">Steinke, Thomas</collection>
    <collection role="projects" number="2013-FFMK">2013-FFMK</collection>
  </doc>
  <doc>
    <id>5797</id>
    <completedYear/>
    <publishedYear>2016</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">Fast In-Memory Checkpointing with POSIX API for Legacy Exascale-Applications</title>
    <parentTitle language="eng">SPPEXA Symposium 2016</parentTitle>
    <identifier type="doi">10.1007/978-3-319-40528-5_19</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>J. Fajerski</author>
    <submitter>Florian Schintke</submitter>
    <author>Matthias Noack</author>
    <author>Alexander Reinefeld</author>
    <author>Florian Schintke</author>
    <author>Thorsten Schütt</author>
    <author>Thomas Steinke</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="persons" number="steinke">Steinke, Thomas</collection>
    <collection role="projects" number="2006-XtreemFS">2006-XtreemFS</collection>
    <collection role="projects" number="2013-FFMK">2013-FFMK</collection>
  </doc>
  <doc>
    <id>967</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2007-09-03</completedDate>
    <publishedDate>2007-09-03</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">P2P Routing of Range Queries in Skewed Multidimensional Data Sets</title>
    <abstract language="eng">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.</abstract>
    <identifier type="serial">07-23</identifier>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="opus3-id">980</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-9671</identifier>
    <author>Alexander Reinefeld</author>
    <submitter>unknown unknown</submitter>
    <author>Florian Schintke</author>
    <author>Thorsten Schütt</author>
    <series>
      <title>ZIB-Report</title>
      <number>07-23</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>structured overlays</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>range queries</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>routing</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>multidimensional data sets</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="ccs" number="E.1">DATA STRUCTURES</collection>
    <collection role="ccs" number="C.2.4">Distributed Systems</collection>
    <collection role="ccs" number="H.3.3">Information Search and Retrieval</collection>
    <collection role="ccs" number="H.3.4">Systems and Software</collection>
    <collection role="ccs" number="H.3.5">Online Information Services</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>
    <collection role="persons" number="schuett">Schütt, Thorsten</collection>
    <collection role="projects" number="2008-Scalaris">2008-Scalaris</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/967/ZR_07_23.pdf</file>
  </doc>
  <doc>
    <id>1007</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>deu</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>masterthesis</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2002-12-31</completedDate>
    <publishedDate>2002-12-31</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="deu">Synchronisation von verteilten Verzeichnisstrukturen</title>
    <abstract language="deu">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.</abstract>
    <abstract language="eng">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.</abstract>
    <identifier type="opus3-id">1022</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-10071</identifier>
    <author>Thorsten Schütt</author>
    <submitter>unknown unknown</submitter>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="collections" number="">Studienabschlussarbeiten</collection>
    <collection role="institutes" number="vas">Distributed Algorithms and Supercomputing</collection>
    <collection role="persons" number="schuett">Schütt, Thorsten</collection>
    <thesisPublisher>Zuse Institute Berlin (ZIB)</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-zib/files/1007/SchuettDiplom.pdf</file>
  </doc>
  <doc>
    <id>873</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2005-08-26</completedDate>
    <publishedDate>2005-08-26</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Chord#: Structured Overlay Network for Non-Uniform Load-Distribution</title>
    <abstract language="eng">\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.</abstract>
    <identifier type="serial">05-40</identifier>
    <identifier type="opus3-id">873</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-8736</identifier>
    <author>Thorsten Schütt</author>
    <author>Florian Schintke</author>
    <author>Alexander Reinefeld</author>
    <series>
      <title>ZIB-Report</title>
      <number>05-40</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>DHT</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>P2P</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Range Queries</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="ccs" number="C.2.1">Network Architecture and Design</collection>
    <collection role="ccs" number="C.2.2">Network Protocols</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>
    <collection role="persons" number="schuett">Schütt, Thorsten</collection>
    <collection role="projects" number="2008-Scalaris">2008-Scalaris</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/873/ZR-05-40.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/873/ZR-05-40.ps</file>
  </doc>
</export-example>
