Concept

Usenet

Publications associées (9)

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

Rebooting Virtual Memory with Midgard

Siddharth Gupta

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

EPFL2023

Multilevel-Cell Phase-Change Memory: A Viable Technology

Milos Stanisavljevic, Aravinthan Athmanathan, Evangelos Eleftheriou

In order for any non-volatile memory (NVM) to be considered a viable technology, its reliability should be verified at the array level. In particular, properties such as high endurance and at least moderate data retention are considered essential. Phase-ch ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Impact of body biasing on the retention time of gain-cell memories

Andreas Peter Burg, Adam Shmuel Teman, Pascal Andreas Meinerzhagen

Gain-cell-based embedded dynamic random-access memory (DRAMs) are a potential high-density alternative to mainstream static random-access memory (SRAM). However, the limited data retention time of these dynamic bitcells results in the need for power-consum ...

2013

Scalable Video Dissemination with Prioritized Network Coding

Pascal Frossard, Nikolaos Thomos, Eymen Kurdoglu

In this paper, we present a pull-based dissemination protocol for efficient distribution of scalable video content in overlay peer-to-peer networks with mesh structures. The proposed protocol employs prioritized network coding, where the network coded pack ...

2011

Extending Peer-to-Peer Networks for Approximate Search

Ion Constantinescu, Michael Ignaz Schumacher, Roman Schmidt, Alain Mowat

Peer-to-Peer (P2P) networks are used worldwide for many applications such as file sharing or news servers. There are many different implementations available, each with its pros and cons. In this paper, we propose a way to enable approximate queries in a P ...

2008

Optimal Scheduling of Peer-to-Peer File Dissemination

Jochen Mundinger

Peer-to-peer (P2P) overlay networks such as BitTorrent and Avalanche are increasingly used for disseminating potentially large files from a server to many end users via the Internet. The key idea is to divide the file into many equally-sized parts and then ...

2007

Analysis of peer-to-peer file dissemination

Jochen Mundinger

In recent years, overlay networks have proven a popular way of disseminating potentially large files from a single server S to a potentially large group of N end users via the Internet. A number of algorithms and protocols have been suggested, implemented ...

2006

Analysis of Peer-to-Peer File Dissemination amongst Users of Different Upload Capacities

Jochen Mundinger

In recent years, overlay networks have proven an effective way of disseminating a file from a single source to a group of end users via the Internet. A number of algorithms and protocols have been suggested, implemented and studied. In particular, much att ...

2006

On the Implementation and Use of Message Logging

Willy Zwaenepoel

We present a number of experiments showing that for compute-intensive applications executing in parallel on clusters of workstations, message logging has higher failure-free overhead than coordinated checkpointing. Message logging protocols, however, resul ...

1994