Concept

Adressage mémoire

Publications associées (129)

Transactions in the Jungle

Rachid Guerraoui, Michal Kapalka, Vasu Singh

Transactional memory (TM) has shown potential to simplify the task of writing concurrent programs. However, the semantics of interactions between transactions managed by a TM and non-transactional operations, while widely studied, lacks a clear formal spec ...

2009

More on Castor: the Scalable Secure Routing for Ad-hoc Networks

Karl Aberer, Panagiotis Papadimitratos, Marcin Poturalski, Wojciech Galuba, Zoran Despotovic

Wireless ad hoc networks are inherently vulnerable, as any node can disrupt the communication of potentially any other node in the network. Many solutions to this problem have been proposed. In this paper, we take a fresh and comprehensive approach, simult ...

2009

Matching techniques ride to rescue OLED displays

Combinatorial optimization problems have recently emerged in the design of controllers for OLED displays. The objective is to decompose an image into subframes minimizing the addressing time and thereby also the amplitude of the electrical current through ...

Springer2009

A system model for water management

André Mermoud, Colin Schenk, Bastien Roquier

Although generally accepted as a necessary step to improve water management and planning, integrated water resources management (IWRM) methodology does not provide a clear definition of what should be integrated. The various water-related issues that IWRM ...

Springer-Verlag2009

AVC Entropy Coding for MPEG Reconfigurable Video Coding

Ihab Mostafa Amin Mohamed Amer, Hussein Aman-Allah

The emergence of the Reconfigurable Video Coding (RVC) Standard has led to the development of its accompanying decoding Video Tool Library (VTL). This library is comprised of a set of video coding tool also referred to as Functional Units (FUs) that are co ...

2009

Sharing is Harder than Agreeing

Rachid Guerraoui

One of the most celebrated results of the theory of distributed computing is the impossibility, in an asynchronous system of

n

processes that communicate through shared memory registers, to solve the set agreement problem where the processes need to deci ...

2008

A co-design platform for Algorithm/Architecture design exploration

Marco Mattavelli, Christophe Lucarz, Julien Dubois

The efﬁcient implementation of multimedia algorithms, for the ever increasing complexity of the speciﬁcations and the emergence of the new generation of processing platforms characterized by multicore and multicomponent parallel architectures, requires app ...

IEEE2008

In-situ electrical addressing of one-dimensional gold nanoparticle assemblies

Heinrich Hofmann, Frédéric Juillerat

Substrates with 1-dimensional nanosize grooves were prepared using extreme-ultraviolet interference lithography (EUV-IL), wherein gold nanoparticles were self-assembled to form 1-dimensional structures. To measure the electrical properties of gold nanopart ...

2008

Variability-Aware Design of Multilevel Logic Decoders for Nanoscale Crossbar Memories

Giovanni De Micheli, Mihai Adrian Ionescu, David Atienza Alonso, Didier Bouvet, Kirsten Emilie Moselund, Yusuf Leblebici, Mohamed Haykel Ben Jamaa

The fabrication of crossbar memories with sublithographic features is expected to be feasible within several emerging technologies; in all of them, the nanowire (NW) decoder is a critical part since it bridges the sublithographic wires to the outer circuit ...

2008

PAI: A lightweight mechanism for single-node memory recovery in DSM servers

Babak Falsafi

Several recent studies identify the memory system as the most frequent source of hardware failures in commercial servers. Techniques to protect the memory system from failures must continue to service memory requests, despite hardware failures. Furthermore ...

2007

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

Sharing is Harder than Agreeing

Rachid Guerraoui

One of the most celebrated results of the theory of distributed computing is the impossibility, in an asynchronous system of

n

processes that communicate through shared memory registers, to solve the set agreement problem where the processes need to deci ...

2008