Options
Schiavoni, Valerio
Nom
Schiavoni, Valerio
Affiliation principale
Fonction
Maitre d'enseignement et recherche (MER), Professeur Titulaire
Email
valerio.schiavoni@unine.ch
Identifiants
Résultat de la recherche
12 Résultats
Voici les éléments 1 - 10 sur 12
- PublicationRestriction temporaireNVCache: A Plug-and-Play NVMM-based I/O Booster for Legacy Systems(2021)
; ; ; ; ;Ramalhete, Pedro; Thomas, Gaël - PublicationRestriction temporaireTrust Management as a Service: Enabling Trusted Execution in the Face of Byzantine Stakeholders(2020)
;Gregor, Franz ;Ozga, Wojciech; ; ;Quoc, Do ;Arnautov, Sergei ;Martin, André; ; Fetzer, Christof - PublicationRestriction temporaire
- PublicationRestriction temporaireSGX-Aware Container Orchestration for Heterogeneous Clusters(2018)
; ; ; ; ; Fetzer, Christof - PublicationRestriction temporaireCYCLOSA: Decentralizing Private Web Search through SGX-Based Browser Extensions(2018)
; ;Goltzsche, David ;Mokhtar, Sonia ;Bouchenak, Sara ;Boutet, Antoine; ;Kapitza, Rüdiger; - PublicationRestriction temporaire
- PublicationAccès libreBlock placement strategies for fault-resilient distributed tuple spaces: an experimental study(: Springer, 2017-6-19)
; ;Buravlev, Vitaly ;Antares Mezzina, ClaudioThe tuple space abstraction provides an easy-to-use programming paradigm for distributed applications. Intuitively, it behaves like a distributed shared memory, where applications write and read entries (tuples). When deployed over a wide area network, the tuple space needs to efficiently cope with faults of links and nodes. Erasure coding techniques are increasingly popular to deal with such catastrophic events, in particular due to their storage efficiency with respect to replication. When a client writes a tuple into the system, this is first striped into k blocks and encoded into 𝑛>𝑘 blocks, in a fault-redundant manner. Then, any k out of the n blocks are sufficient to reconstruct and read the tuple. This paper presents several strategies to place those blocks across the set of nodes of a wide area network, that all together form the tuple space. We present the performance trade-offs of different placement strategies by means of simulations and a Python implementation of a distributed tuple space. Our results reveal important differences in the efficiency of the different strategies, for example in terms of block fetching latency, and that having some knowledge of the underlying network graph topology is highly beneficial. - PublicationRestriction temporaireSecureStreams: A Reactive Middleware Framework for Secure Data Stream Processing(2017)
;Havet, Aurelien; ; ; ;Rouvoy, Romain - PublicationRestriction temporaireSecureCloud: Secure big data processing in untrusted clouds(2017)
;Kelbert, Florian ;Gregor, Franz; ;Köpsell, Stefan; ;Havet, Aurelien; ; ;Fetzer, ChristofPietzuch, Peter