Concept

Mémoire à tores magnétiques

Publications associées (147)

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

Generalizing State Machine Replication

Rachid Guerraoui

We show that, with k-set consensus, any number of processes can emulate k state machines of which at least one progresses. This generalizes the celebrated universality of consensus which enables to build a state machine that always progresses. Besides some ...

2010

Parallelization of the LEMan Code with MPI and OpenMP

Wilfred Anthony Cooper, Nicolas Mellet

The low-frequency wave propagation code LEMan has been parallelized. Due to large memory requirement but fast computation with the cold model, the parallelization is limited to a low number of processors. The specific block-tridiagonal structure of the mat ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2009

The Gigavision Camera

Martin Vetterli, Edoardo Charbon, Sabine Süsstrunk, Luciano Sbaiz, Feng Yang

We propose a new image device called gigavision camera. The main differences between a conventional and a gigavision camera are that the pixels of the gigavision camera are binary and orders of magnitude smaller. A gigavision camera can be built using stan ...

2009

Magnetic track array for efficient bead capture in microchannels

Hubert Girault, Anne-Laure Gassner, Mélanie Abonnenc

Magnetism-based microsystems, as those dedicated to immunoaffinity separations or (bio)chemical reactions, take benefit of the large surface area-to-volume ratio provided by the immobilized magnetic beads, thus increasing the sensitivity of the analysis. A ...

Springer Verlag2009

The Semantics of Progress in Lock-Based Transactional Memory

Rachid Guerraoui, Michal Kapalka

Transactional memory (TM) is a promising paradigm for concurrent programming. Whereas the number of TM implementations is growing, however, little research has been conducted to precisely define TM semantics, especially their progress guarantees. This pape ...

ACM2009

Magnonics: Spin Waves on the Nanoscale

Dirk Grundler

Magnetic nanostructures have long been in the focus of intense research in the magnetic storage industry. For data storage the nonvolatility of magnetic states is of utmost relevance. As information technology generates the need for higher and higher data- ...

2009

A new parallelized 3D SPH model: resolution of water entry problems ans scalability study

Pierre Maruzewski

The parallelized model is first presented and a scalability study is achieved. For computational time saving and memory requirement reasons, the implementation of a three dimensional SPH code implies the need for its parallelization, in order to make possi ...

2008

The Semantics of Progress in Lock-Based Transactional Memory

Rachid Guerraoui, Michal Kapalka

2008

The Projectron: a Bounded Kernel-Based Perceptron

Barbara Caputo

We present a discriminative online algorithm with a bounded memory growth, which is based on the kernel-based Perceptron. Generally, the required memory of the kernel-based Perceptron for storing the online hypothesis is not bounded. Previous work has been ...

2008

The Projectron: a Bounded Kernel-Based Perceptron

Barbara Caputo

IDIAP2008