@article{SchuettSchintkeReinefeld2008, author = {Sch{\"u}tt, Thorsten and Schintke, Florian and Reinefeld, Alexander}, title = {Range Queries on structured overlay networks}, series = {Computer Communications}, volume = {31}, journal = {Computer Communications}, number = {2}, publisher = {Elsevier}, doi = {10.1016/j.comcom.2007.08.027}, pages = {280 -- 291}, year = {2008}, language = {en} } @inproceedings{SchuettSchintkeReinefeld2008, author = {Sch{\"u}tt, Thorsten and Schintke, Florian and Reinefeld, Alexander}, title = {Scalaris: Reliable Transactional P2P Key/Value}, series = {ERLANG '08: Proceedings of the 7th ACM SIGPLAN workshop on ERLANG}, booktitle = {ERLANG '08: Proceedings of the 7th ACM SIGPLAN workshop on ERLANG}, doi = {10.1145/1411273.1411280}, pages = {41 -- 47}, year = {2008}, 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{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} } @inproceedings{SchuettSchintkeReinefeld2007, author = {Sch{\"u}tt, Thorsten and Schintke, Florian and Reinefeld, Alexander}, title = {A Structured Overlay for Multi-dimensional Range Queries}, series = {Euro-Par Conference}, volume = {4641}, booktitle = {Euro-Par Conference}, editor = {Kermarrec, Anne-Marie}, publisher = {Springer}, doi = {10.1007/978-3-540-74466-5_54}, pages = {503 -- 513}, year = {2007}, 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{SchuettReinefeldSchintkeetal.2009, author = {Sch{\"u}tt, Thorsten and Reinefeld, Alexander and Schintke, Florian and Hoffmann, Marie}, title = {Gossip-based Topology Inference for Efficient Overlay Mapping on Data Centers}, series = {Peer-to-Peer Computing}, booktitle = {Peer-to-Peer Computing}, doi = {10.1109/P2P.2009.5284553}, pages = {147 -- 150}, year = {2009}, language = {en} } @inproceedings{SchuettReinefeldSchintkeetal.2009, author = {Sch{\"u}tt, Thorsten and Reinefeld, Alexander and Schintke, Florian and Hennig, C.}, title = {Self-Adaptation in Large-Scale Systems: A Study on Structured Overlays Across Multiple Datacenters}, series = {Architectures and Languages for Self-Managing Distributed Systems (SelfMan@SASO)}, booktitle = {Architectures and Languages for Self-Managing Distributed Systems (SelfMan@SASO)}, doi = {10.1109/SASOW.2010.65}, year = {2009}, language = {en} } @article{SchuettReinefeldDoebbelin, author = {Sch{\"u}tt, Thorsten and Reinefeld, Alexander and D{\"o}bbelin, Robert}, title = {MR-search: massively parallel heuristic search}, series = {Concurrency and Computation: Practice and Experience}, volume = {25}, journal = {Concurrency and Computation: Practice and Experience}, number = {1}, doi = {10.1002/cpe.1833}, pages = {40 -- 54}, language = {en} } @inproceedings{SchuettMoserPlantikowetal.2008, author = {Sch{\"u}tt, Thorsten and Moser, Monika and Plantikow, Stefan and Schintke, Florian and Reinefeld, Alexander}, title = {A Transactional Scalable Distributed Data Store}, series = {1st IEEE International Scalable Computing Challenge, co-located with CCGrid'08}, booktitle = {1st IEEE International Scalable Computing Challenge, co-located with CCGrid'08}, year = {2008}, language = {en} }