Concept

Dépendance au sentier

Publications associées (32)

One-shot Garbage Collection for In-memory OLTP through Temporality-aware Version Storage

Anastasia Ailamaki, Periklis Chrysogelos, Angelos Christos Anadiotis, Syed Mohammad Aunn Raza

Most modern in-memory online transaction processing (OLTP) engines rely on multi-version concurrency control (MVCC) to provide data consistency guarantees in the presence of conflicting data accesses. MVCC improves concurrency by generating a new version o ...

ACM2023

uKharon: A Membership Service for Microsecond Applications

Rachid Guerraoui, Antoine Murat, Javier Picorel Obando, Athanasios Xygkis

Modern data center fabrics open the possibility of microsecond distributed applications, such as data stores and message queues. A challenging aspect of their development is to ensure that, besides being fast in the common case, these applications react fa ...

USENIX Association2023

A Comprehensive Timing Model for Accurate Frequency Tuning in Dataflow Circuits

Paolo Ienne, Andrea Guerrieri, Lana Josipovic, Carmine Rizzi

The ability of dataflow circuits to implement dynamic scheduling promises to overcome the conservatism of static scheduling techniques that high-level synthesis tools typically rely on. Yet, the same distributed control mechanism that allows dataflow circu ...

IEEE COMPUTER SOC2022

Clouseau: Blockchain-based Data Integrity for HDFS Clusters

Ioannis Mytilinis

As the volume of produced data is exponentially increasing, companies tend to rely on distributed systems to meet the surging demand for storage capacity. With the business workflows becoming more and more complex, such systems often consist of or are acce ...

IEEE COMPUTER SOC2021

Metropolitan Innovation Systems: Inquiry into the co-evolving relations between Industry, University and Government

Jiayun Shen

Innovation is crucial and decisive for the long-term development of a metropolitan region in the global economy. While firms certainly play a significant role in the development of specific innovation, the environment that nur-tures innovative firms and di ...

EPFL2020

Privacy-preserving semi-parallel logistic regression training with fully homomorphic encryption

Juan Ramón Troncoso-Pastoriza

Background Privacy-preserving computations on genomic data, and more generally on medical data, is a critical path technology for innovative, life-saving research to positively and equally impact the global population. It enables medical research algorithm ...

2020

Braided rivers networks dynamics: analyzing topographic data from a large flume experiment

Christophe Ancey, Daniel Vito Papa

Braided rivers are highly dynamical systems characterized by varying network-like structures even under quasi-steady conditions. Understanding their dynamics is crucial in geomorphology and river engineering (e.g., river restoration in Alpine and piedmond ...

2020

On the relation between transversal and longitudinal scaling in cities

João Vitor Meirelles de Miranda

Does the scaling relationship between population sizes of cities with urban metrics like economic output and infrastructure (transversal scaling) mirror the evolution of individual cities in time (longitudinal scaling)? The answer to this question has impo ...

2020

Finding a Needle in the Haystack of Hardened Interconnect Patterns

Paolo Ienne, Grace Zgheib, Stefan Nikolic

Circuits naturally exhibit recurring patterns of local interconnect. Hardening those patterns when designing Field Programmable Gate Array (FPGA) clusters can both eliminate slow programmable connections from the critical path and remove the need for trans ...

IEEE2019

On the Delays in Time-Varying Networks: Does Larger Service-Rate Variance Imply Larger Delays?

Patrick Thiran, Sébastien Christophe Henri

In all networks, link or route capacities fluctuate for multiple reasons, e.g., fading and multi-path effects on wireless channels, interference and contending users on a shared medium, varying loads in WAN routers, impedance changes on power-line channels ...

2018

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search