@inproceedings{SchuettSchintkeReinefeld2003, author = {Sch{\"u}tt, Thorsten and Schintke, Florian and Reinefeld, Alexander}, title = {Efficient Synchronization of Replicated Data in Distributed Systems}, volume = {2657}, booktitle = {Computational Science - ICCS 2003, International Conference, Melbourne, Australia and St. Petersburg, Russia, June 2-4, 2003. Proceedings, Part I}, editor = {Sloot, Peter and Abramson, David and Bogdanov, Alexander and Dongarra, Jack and Zomaya, Albert and Gorbachev, Yuri}, publisher = {Springer}, doi = {10.1007/3-540-44860-8_28}, pages = {274 -- 283}, year = {2003}, language = {en} } @inproceedings{AnderssonSachsTumaetal.2015, author = {Andersson, Stefan and Sachs, Stephen and Tuma, Christian and Sch{\"u}tt, Thorsten}, title = {DataWarp: First Experiences}, booktitle = {Cray User Group}, year = {2015}, language = {en} } @inproceedings{WendeNoackSchuettetal.2015, author = {Wende, Florian and Noack, Matthias and Sch{\"u}tt, Thorsten and Sachs, Stephen and Steinke, Thomas}, title = {Application Performance on a Cray XC30 Evaluation System with Xeon Phi Coprocessors at HLRN-III}, booktitle = {Cray User Group}, year = {2015}, language = {en} } @article{ReinefeldSchuettDoebbelin2013, author = {Reinefeld, Alexander and Sch{\"u}tt, Thorsten and D{\"o}bbelin, Robert}, title = {Analyzing the performance of SMP memory allocators with iterative MapReduce applications}, volume = {39}, journal = {Parallel Computing}, number = {12}, publisher = {Elsevier}, doi = {10.1016/j.parco.2013.09.007}, pages = {879 -- 889}, year = {2013}, language = {en} } @article{SalemSchintkeSchuettetal.2017, author = {Salem, Farouk and Schintke, Florian and Sch{\"u}tt, Thorsten and Reinefeld, Alexander}, title = {Supporting various interconnects in FLESnet using Libfabric}, journal = {CBM Progress Report 2016}, isbn = {978-3-9815227-4-7}, pages = {159 -- 160}, year = {2017}, language = {en} } @incollection{CoutinhoStillwellArgyrakietal.2017, author = {Coutinho, Jose and Stillwell, Mark and Argyraki, Katerina and Ioannidis, George and Iordache, Anca and Kleineweber, Christoph and Koliousis, Alexandros and McGlone, John and Pierre, Guillaume and Ragusa, Carmelo and Sanders, Peter and Sch{\"u}tt, Thorsten and Yu, Teng and Wolf, Alexander}, title = {The HARNESS Platform: A Hardware- and Network-Enhanced Software System for Cloud Computing}, booktitle = {Software Architecture for Big Data and the Cloud}, publisher = {Morgan Kaufmann}, isbn = {9780128054673}, pages = {323 -- 351}, year = {2017}, language = {en} } @inproceedings{KleineweberReinefeldSchuett2014, author = {Kleineweber, Christoph and Reinefeld, Alexander and Sch{\"u}tt, Thorsten}, title = {QoS-aware Storage Virtualization for Cloud File Systems}, booktitle = {Proceedings of the 1st ACM International Workshop on Programmable File Systems}, doi = {10.1145/2603941.2603944}, pages = {19 -- 26}, year = {2014}, language = {en} } @inproceedings{WeinholdLackorzynskiBierbaumetal.2016, author = {Weinhold, Carsten and Lackorzynski, Adam and Bierbaum, Jan and K{\"u}ttler, Martin and Planeta, Maksym and H{\"a}rtig, Hermann and Shiloh, Amnon and Levy, Ely and Ben-Nun, Tal and Barak, Amnon and Steinke, Thomas and Sch{\"u}tt, Thorsten and Fajerski, Jan and Reinefeld, Alexander and Lieber, Matthias and Nagel, Wolfgang}, title = {FFMK: A Fast and Fault-tolerant Microkernel-based System for Exascale Computing}, booktitle = {SPPEXA Symposium 2016}, doi = {10.1007/978-3-319-40528-5_18}, year = {2016}, language = {en} } @inproceedings{FajerskiNoackReinefeldetal.2016, author = {Fajerski, J. and Noack, Matthias and Reinefeld, Alexander and Schintke, Florian and Sch{\"u}tt, Thorsten and Steinke, Thomas}, title = {Fast In-Memory Checkpointing with POSIX API for Legacy Exascale-Applications}, booktitle = {SPPEXA Symposium 2016}, doi = {10.1007/978-3-319-40528-5_19}, year = {2016}, language = {en} } @misc{ReinefeldSchintkeSchuett2007, author = {Reinefeld, Alexander and Schintke, Florian and Sch{\"u}tt, Thorsten}, title = {P2P Routing of Range Queries in Skewed Multidimensional Data Sets}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-9671}, number = {07-23}, year = {2007}, abstract = {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.}, language = {en} } @misc{Schuett2002, type = {Master Thesis}, author = {Sch{\"u}tt, Thorsten}, title = {Synchronisation von verteilten Verzeichnisstrukturen}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-10071}, school = {Zuse Institute Berlin (ZIB)}, year = {2002}, abstract = {Das Management von großen Datenmengen spielt eine immer wichtigere Rolle, wie aktuelle Entwicklungen in der Hochenergiephysik [2] zeigen. F{\"u}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{\"o}glich, unabh{\"a}ngige {\"A}nderungen an beliebigen Repositories gleichzeitig durchzuf{\"u}hren. Das Verfahren ben{\"o}tigt keine zentrale Instanz, wodurch eine gegen{\"u}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{\"u}cksichtigen. Durch die Verwendung einer Offline-Synchronisation werden {\"A}nderungen erst dann an andere Rechner propagiert, wenn der Nutzer dies anst{\"o}ßt. Das kann zum Beispiel nach einer abgeschlossenen Transaktion, die {\"A}nderungen an mehreren Dateien beinhaltet, angemessen sein.}, language = {de} } @misc{SchuettSchintkeReinefeld2005, author = {Sch{\"u}tt, Thorsten and Schintke, Florian and Reinefeld, Alexander}, title = {Chord\#: Structured Overlay Network for Non-Uniform Load-Distribution}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-8736}, number = {05-40}, year = {2005}, abstract = {\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.}, language = {en} }