<?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>
</export-example>
