@misc{Schuett, 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)}, 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} } @inproceedings{SchintkeSchuettReinefeld2003, author = {Schintke, Florian and Sch{\"u}tt, Thorsten and Reinefeld, Alexander}, title = {A Framework for Self-Optimizing Grids Using P2P Components}, series = {14th International Workshop on Database and Expert Systems Applications (DEXA'03), September 1-5, 2003, Prague, Czech Republic}, booktitle = {14th International Workshop on Database and Expert Systems Applications (DEXA'03), September 1-5, 2003, Prague, Czech Republic}, publisher = {IEEE Computer Society}, doi = {10.1109/DEXA.2003.1232101}, pages = {689 -- 693}, year = {2003}, language = {en} } @inproceedings{SchuettSchintkeReinefeld2003, author = {Sch{\"u}tt, Thorsten and Schintke, Florian and Reinefeld, Alexander}, title = {Efficient Synchronization of Replicated Data in Distributed Systems}, series = {Computational Science - ICCS 2003, International Conference, Melbourne, Australia and St. Petersburg, Russia, June 2-4, 2003. Proceedings, Part I}, 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{SchuettMerzkyHutanuetal.2004, author = {Sch{\"u}tt, Thorsten and Merzky, Andr{\´e} and Hutanu, Andrei and Schintke, Florian}, title = {Remote partial file access using compact pattern descriptions}, series = {4th IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGrid 2004), April 19-22, 2004, Chicago, Illinois, USA}, booktitle = {4th IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGrid 2004), April 19-22, 2004, Chicago, Illinois, USA}, publisher = {IEEE Computer Society}, doi = {10.1109/CCGrid.2004.1336604}, pages = {482 -- 489}, year = {2004}, language = {en} } @incollection{ReinefeldSchintkeSchuett2004, author = {Reinefeld, Alexander and Schintke, Florian and Sch{\"u}tt, Thorsten}, title = {Scalable and Self-Optimizing Data Grids}, series = {Annual Review of Scalable Computing}, volume = {6}, booktitle = {Annual Review of Scalable Computing}, number = {chapter 2}, publisher = {World Scientific}, doi = {10.1142/9789812794727_0002}, pages = {30 -- 60}, year = {2004}, language = {en} } @article{AllenDavisGoodaleetal.2005, author = {Allen, Gabrielle and Davis, K. and Goodale, Tom and Hutanu, Andrei and Kaiser, Hartmut and Kielmann, Thilo and Merzky, Andre and Nieuwpoort, R. and Reinefeld, Alexander and Schintke, Florian and Sch{\"u}tt, Thorsten and Seidel, Edward and Ullmer, Brygg}, title = {The Grid Application Toolkit: Toward Generic and Easy Appliction Programming Interfaces for the Grid}, series = {Procceedings of the IEEE}, volume = {93}, journal = {Procceedings of the IEEE}, number = {3}, publisher = {IEEE Computer Society Press}, doi = {10.1109/JPROC.2004.842755}, pages = {534 -- 550}, year = {2005}, language = {en} } @misc{SchuettSchintkeReinefeld, 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}, 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} } @inproceedings{AndrzejakReinefeldSchintkeetal.2006, author = {Andrzejak, Artur and Reinefeld, Alexander and Schintke, Florian and Sch{\"u}tt, Thorsten}, title = {On Adaptability in Grid Systems}, series = {Future Generation Grids: Proceedings of the Workshop on Future Generation Grids, November 1-5, 2004, Dagstuhl, Germany}, booktitle = {Future Generation Grids: Proceedings of the Workshop on Future Generation Grids, November 1-5, 2004, Dagstuhl, Germany}, editor = {Getov, Vladimir and Laforenza, Domenico and Reinefeld, Alexander}, publisher = {Springer}, doi = {10.1007/978-0-387-29445-2_2}, pages = {29 -- 46}, year = {2006}, language = {en} } @inproceedings{SchuettSchintkeReinefeld2006, author = {Sch{\"u}tt, Thorsten and Schintke, Florian and Reinefeld, Alexander}, title = {Structured Overlay without Consistent Hashing: Empirical Results}, series = {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}, booktitle = {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}, publisher = {IEEE Computer Society}, doi = {10.1109/CCGRID.2006.175}, pages = {8}, year = {2006}, language = {en} } @misc{ReinefeldSchintkeSchuett2007, author = {Reinefeld, Alexander and Schintke, Florian and Sch{\"u}tt, Thorsten}, title = {Vorrichtung und Verfahren zum Abrufen / Speichern von elektronischen Daten in einem System mit mehreren Datenverarbeitungseinheiten}, publisher = {Europ{\"a}isches Patent EP 1 744 257 A1}, year = {2007}, language = {en} }