Work

How to use the past to face the future?

Year: 2020

Type: report

Abstract: Large-scale distributed systems are highly dynamic: nodes may crash, messages may be delayed or lost, new nodes may join, virtual machines may migrate... The workload may also vary a lot depending on the users or applications behavior. Thus, distributed systems and services must adapt continuously in order to remain efficient. To do so, distributed systems usually monitor their environment and maintain a knowledge of what has happened (e.g., heartbeats time-stamps for a failure detection mechanism, data access statistics for a distributed storage systems, etc.). Based on these observations, a distributed system can decide to adapt to better tackle future situations (migrate a virtual machine, create a new data replica, etc.). However, even if a system has a full event log, it is not a trivial task to decide how much and which part of the past must be taken into account. In this paper we propose and study the impact of multiple approaches, from "full-memory" to "no-memory" through "time-window" and "fading-memory" based strategies.

Source: HAL

Authors: Mauffret, Etienne, Vernier, Flavien, Monnet, Sébastien

Institutions: Laboratoire de l'Informatique du Parallélisme, AVALON: Algorithms and Software Architectures for Distributed and HPC Platforms, Université Savoie Mont Blanc

Language: English

Topic: Distributed systems and fault tolerance

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W4287587724

Cites:

Cited by:

Related to: 10