Výsledky vyhledávání - "dynamic distributed system"

Efficient Consensus-Free Weight Reassignment for Atomic Storage

Autor: Hasan Heydari, Guthemberg Silvestre, Luciana Arantes

Publikováno v: The 20th IEEE International Symposium on Network Computing and Applications (NCA 2021)
The 20th IEEE International Symposium on Network Computing and Applications (NCA 2021), Nov 2021, Virtual, France
The 20th IEEE International Symposium on Network Computing and Applications (NCA 2021), Nov 2021, Virtual, Italy
NCA 2021-20th IEEE International Symposium on Network Computing and Applications
NCA 2021-20th IEEE International Symposium on Network Computing and Applications, Nov 2021, Virtual, France

International audience; Weighted voting is a conventional approach to improving the performance of replicated systems based on commonly-used majority quorum systems in heterogeneous environments. In long-lived systems, a weight reassignment protocol

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::38286557b8a05effe3f5890bc35352cb
https://hal-enac.archives-ouvertes.fr/hal-03454633/file/main.pdf

Zobrazit plný text záznamu

An Analytical Method for Generating a Data Set for a Neural Model of a Conveyor Line

Autor: Pihnastyi, O. M., Kozhevnikov, G. K., Bondarenko, Tetiana

Models using neural networks are a rather promising class of models for designing highly efficient control systems for a dynamic distributed transport system of the conveyor type. An important problem in constructing a model of a conveyor-type transp

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______3033::6e77246279e70033cf1f96ed1577698c
http://repository.kpi.kharkov.ua/handle/KhPI-Press/49453

Zobrazit plný text záznamu

Dissertation/ Thesis

Une approche distribuée pour les problèmes de couverture dans les systèmes hautement dynamiques.

Autor: Kaaouachi, Mohamed Hamza

Un système distribué est un système composé d'éléments de calcul autonomes dotés de capacité de communication. Il s'agit d'un modèle commun pour l'étude des réseaux. L'évolution rapide des réseaux sans fils et/ou mobiles aussi bien dans

Externí odkaz: http://www.theses.fr/2016PA066058/document

Zobrazit plný text záznamu

A distributed approach for covering problems in highly dynamic systems

Autor: Kaaouachi, Mohamed Hamza

Publikováno v: Réseaux et télécommunications [cs.NI]. Université Pierre et Marie Curie-Paris VI, 2016. Français. ⟨NNT : 2016PA066058⟩

A distributed system is a system of autonomous computing components endowed with communication abilities. This is a common model for the study of networks. The quick evolution of wireless and mobile network both in everyday life and in research gradu

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::955514cffb86df02de989ab72859115e
https://tel.archives-ouvertes.fr/tel-01289153

Zobrazit plný text záznamu

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Stochastic Modeling of Dynamic Distributed Systems with Crash Recovery and Its Application to Atomic Registers

Autor: Andreas Klappenecker, Jennifer L. Welch, Hyunyoung Lee, Silvia Bonomi

Publikováno v: Lecture Notes in Computer Science ISBN: 9783642354755
OPODIS

In a dynamic distributed system, processes can join and leave the system. We consider such a system in which processes are subject to crash failures from which they may recover. Assuming a stochastic model for joining, leaving, crashing, and recoveri

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::202798a9a47c2563bb36749aecfdd083
https://doi.org/10.1007/978-3-642-35476-2_6

Zobrazit plný text záznamu

k-bounded set objects in eventually synchronous distributed systems with churn and continuous accesses

Autor: Roberto Baldoni, Silvia Bonomi, Michel Raynal

Publikováno v: EWDC

This paper introduces a "k-bounded set object", namely a shared object with limited memory that allows processes to add and remove values as well as take a snapshot of its content. The interest of the k-bounded set lies in the fact that it can be use

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::394ce30ff52a73a2de2d84492c2d744a
https://doi.org/10.1145/1978582.1978603

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání