Concept

Page replacement algorithm

Publications associées (43)

Structural Measures as Guides to Ultrastable States in Overjammed Packings

Jammed, disordered packings of given sets of particles possess a multitude of equilibrium states with different mechanical properties. Identifying and constructing desired states, e.g., of superior stability, is a complex task. Here, we show that in two-di ...

2022

Deciding Robustness for Lower SQL Isolation Levels

Christoph Koch, Bas Ketsman

While serializability always guarantees application correctness, lower isolation levels can be chosen to improve transaction throughput at the risk of introducing certain anomalies. A set of transactions is robust against a given isolation level if every p ...

ASSOC COMPUTING MACHINERY2022

Benchmarking, Analysis, and Optimization of Serverless Function Snapshots

Edouard Bugnion, Evangelos Marios Kogias, Boris Robert Grot, Dmitrii Ustiugov

Serverless computing has seen rapid adoption due to its high scalability and flexible, pay-as-you-go billing model. In serverless, developers structure their services as a collection of functions, sporadically invoked by various events like clicks. High in ...

2021

Rethinking Software Runtimes for Disaggregated Memory

Sanidhya Kashyap, Ivan Puddu

Disaggregated memory can address resource provisioning inefficiencies in current datacenters. Multiple software runtimes for disaggregated memory have been proposed in an attempt to make disaggregated memory practical. These systems rely on the virtual mem ...

ASSOC COMPUTING MACHINERY2021

Extending R2P2 with Congestion Control and Request-Level Scheduling

Konstantinos Prasopoulos

Distributed low-latency datacenter applications must meet strict service-level objectives in the order of microseconds. R2P2 is a novel datacenter transport protocol designed for such services. This work extends R2P2 with congestion control and request-lev ...

2020

Deciding Robustness for Lower SQL Isolation Levels

Christoph Koch, Bas Ketsman

ASSOC COMPUTING MACHINERY2020

A Bayesian approach to NMR crystal structure determination

David Lyndon Emsley, Michele Ceriotti, Albert Hofstetter, Edgar Albert Engel, Federico Maria Paruzzo, Andrea Anelli

Nuclear Magnetic Resonance (NMR) spectroscopy is particularly well suited to determine the structure of molecules and materials in powdered form. Structure determination usually proceeds by finding the best match between experimentally observed NMR chemica ...

2019

Design Guidelines for High-Performance SCM Hierarchies

Babak Falsafi, Edouard Bugnion, Alexandros Daglis, Javier Picorel Obando, Mark Johnathon Sutherland, Dionysios Pnevmatikatos, Dmitrii Ustiugov

With emerging storage-class memory (SCM) nearing commercialization, there is evidence that it will deliver the much-anticipated high density and access latencies within only a fewfactors of DRAM. Nevertheless, the latency-sensitive nature of memory-residen ...

ACM2018

Scalable Synchronization in Shared-Memory Systems: Extrapolating, Adapting, Tuning

Georgios Chatzopoulos

As hardware evolves, so do the needs of applications. To increase the performance of an application, there exist two well-known approaches. These are scaling up an application, using a larger multi-core platform, or scaling out, by distributing work to mul ...

EPFL2018

BLOCK: Efficient Execution of Spatial Range Queries in Main-Memory

Anastasia Ailamaki, Thomas Heinis, Farhan Tauheed, Matthaios Alexandros Olma

The execution of spatial range queries is at the core of many applications, particularly in the simulation sciences but also in many other domains. Although main memory in desktop and supercomputers alike has grown considerably in recent years, most spatia ...

2017

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