Eliminating unscalable communication in transaction processing

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Order, regularities, and patterns are ubiquitous around us. A flock of birds maneuvering in the sky, the self-organization of social insects, a global pandemic or a traffic jam are examples of complex systems where the macroscopic patterns arise from the m ...

In recent years, there has been widespread concern about misinformation and hateful content on social media that are damaging societies. Being one of the most influential social media that practically serves as a newsearch engine, YouTube has accepted crit ...

Cycles are one of the fundamental subgraph patterns and being able to enumerate them in graphs enables important applications in a wide variety of fields, including finance, biology, chemistry, and network science. However, to enable cycle enumeration in r ...

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 ...

The first generation of S-band injectors for free-electron lasers has illustrated high reliability and performance by driving the latest generation of high brightness machines. However, the ultimate electron beam brightness of these devices is limited by t ...

In control system networks, reconfiguration of the controller when agents are leaving or joining the network is still an open challenge, in particular when operation constraints that depend on each agent's behavior must be met. Drawing our motivation from ...

Virtual Memory (VM) is a critical programming abstraction that is widely used in various modern computing platforms. With the rise of datacenter computing and birth of planet-scale online services, the semantic and capacity requirements from memory have ev ...

Finding cycles in directed graphs enables important applications in various domains such as finance, biology, chemistry, and network science. However, as the size of graph datasets continues to grow, it becomes increasingly difficult to discover cycles wit ...

Precise exceptions are a cornerstone of modern computing as they provide the abstraction of sequential instruction execution to programmers while accommodating microarchitectural optimizations. However, increasing compute capabilities in deep memory hierar ...

A search for the rare eta -> mu(+)mu(-)mu(+)mu(-) double-Dalitz decay is performed using a sample of proton-proton collisions, collected by the CMS experiment at the CERN LHC with high-rate muon triggers during 2017 and 2018 and corresponding to an integra ...

Eliminating unscalable communication in transaction processing

Chat with Graph Search

Human-Robot Swarm Interaction: An Explorative Path to Foster Complex Systems Understanding

Referencing in YouTube Knowledge Communication Videos

Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-constrained Cycles

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

Toward a brightness upgrade to the SwissFEL: A high gradient traveling-wave rf photogun

Model Predictive Control for Multi-Agent Systems under Limited Communication and Time-Varying Network Topology

Rebooting Virtual Memory with Midgard

Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-Constrained Cycles

Imprecise Store Exceptions

Observation of the Rare Decay of the η Meson to Four Muons