Concept

Page replacement algorithm

Related publications (43)

Graph Chatbot

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.

Practical Off-chip Meta-data for Temporal Memory Streaming

Anastasia Ailamaki, Babak Falsafi, Michael Ferdman

Prior research demonstrates that temporal memory streaming and related address-correlating prefetchers improve performance of commercial server workloads though increased memory level parallelism. Unfortunately, these prefetchers require large on-chip meta ...

2009

Dynamic Resource Allocation for Database Servers Running on Virtual Storage

Adrian Daniel Popescu, Daniel Lupei, Jin Chen

We introduce a novel multi-resource allocator to dynamically allocate resources for database servers running on virtual storage. Multi-resource allocation involves proportioning the database and storage server caches, and the storage bandwidth between appl ...

2009

Anonymous and Fault-Tolerant Shared-Memory Computing

Rachid Guerraoui, Eric Ruppert

The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? What if processes do not have unique identifiers or do not wish to divulge them for re ...

2007

What Can Be Implemented Anonymously?

Rachid Guerraoui, Eric Ruppert

Abstract. The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? What if processes do not have unique identifiers or do not wish to divulge the ...

2005

What Can Be Implemented Anonymously?

Rachid Guerraoui, Eric Ruppert

2004

Packet scale rate guarantee for non-FIFO nodes

Jean-Yves Le Boudec

Packet Scale Rate Guarantee (PSRG) is a generic node model which underlies the definition of Expedited Forwarding (EF) proposed in the context of Internet Differentiated Services. For the case of FIFO nodes, PSRG is equivalent to the well-understood concep ...

2003

Packet Scale Rate Guarantee for non-FIFO Nodes

Jean-Yves Le Boudec

2002

Packet Scale Rate Guarantee for non-FIFO Nodes

Jean-Yves Le Boudec

2001

Address partitioning in DSM clusters with parallel coherence controllers

Babak Falsafi

Recent research suggests that DSM clusters can benefit from parallel coherence controllers. Parallel controllers requires address partitioning and synchronization to avoid handling multiple coherence events for the same memory address simultaneously. This ...

2000

A methodology for the construction of scheduled systems

Joseph Sifakis

We study a methodology for constructing scheduled systems by restricting successively the behavior of the processes to be scheduled. Restriction is used to guarantee the satisfaction of two types of constraints: schedulability constraints characterizing ti ...

2000