TU Darmstadt / ULB / TUbiblio

Always the Best: Executing Transitions between Search Overlays

Frömmgen, Alexander and Haas, Stefan and Stein, Michael and Rehner, Robert and Buchmann, Alejandro and Mühlhäuser, Max :
Always the Best: Executing Transitions between Search Overlays.
Proceedings of the Workshop on Architecting Self-Managing Distributed Systems (ASDS) ACM
[Conference or Workshop Item] , (2015)

Abstract

Search overlays are distributed systems which allow to easily store and retrieve data shared across a huge number of nodes. A multitude of search overlays exist, each optimized for certain environments, application requirements, and workloads. However, in highly dynamic and heterogeneous environments, the choice of the most suitable overlay changes frequently. In this paper, we propose to execute transitions between search overlays at runtime. This approach allows for switching to the most suitable overlay depending on the requirements and the environment. We analyze how these transitions can be executed and propose multiple transition strategies which differ in their required time, their overhead, and the provided performance during the transition. For the evaluation, we exemplarily executed these transition strategies for two overlays and verified the expected performance properties of the strategies. We show that transitions between search overlays are efficiently possible and can be used to always execute the most suitable search overlay.

Item Type: Conference or Workshop Item
Erschienen: 2015
Creators: Frömmgen, Alexander and Haas, Stefan and Stein, Michael and Rehner, Robert and Buchmann, Alejandro and Mühlhäuser, Max
Title: Always the Best: Executing Transitions between Search Overlays
Language: ["languages_typename_1" not defined]
Abstract:

Search overlays are distributed systems which allow to easily store and retrieve data shared across a huge number of nodes. A multitude of search overlays exist, each optimized for certain environments, application requirements, and workloads. However, in highly dynamic and heterogeneous environments, the choice of the most suitable overlay changes frequently. In this paper, we propose to execute transitions between search overlays at runtime. This approach allows for switching to the most suitable overlay depending on the requirements and the environment. We analyze how these transitions can be executed and propose multiple transition strategies which differ in their required time, their overhead, and the provided performance during the transition. For the evaluation, we exemplarily executed these transition strategies for two overlays and verified the expected performance properties of the strategies. We show that transitions between search overlays are efficiently possible and can be used to always execute the most suitable search overlay.

Title of Book: Proceedings of the Workshop on Architecting Self-Managing Distributed Systems (ASDS)
Publisher: ACM
Uncontrolled Keywords: - SUN - Smart Urban Networks
Divisions: Department of Computer Science
Department of Computer Science > Telecooperation
Event Location: Dubrovnik/Cavtat, Croatia
Date Deposited: 31 Dec 2016 12:59
DOI: 10.1145/2797433.2797441
Identification Number: TUD-CS-2015-0122
Export:

Optionen (nur für Redakteure)

View Item View Item