Concept

Adressage mémoire

Publications associées (129)

Efficient System-Enforced Deterministic Parallelism

Deterministic execution offers many benefits for debugging, fault tolerance, and security. Current methods of executing parallel programs deterministically, however, often incur high costs, allow misbehaved software to defeat repeatability, and transform t ...

2010

Governing the dynamics of the network industries

Matthias Finger, Marc Laperrouza, Nicolas Crettenand

This paper wants to further develop the theory of co-evolution between technology and institutions in the network industries by addressing one of the critiques that is generally raised, namely the lack of taking into account its dynamics. The paper outline ...

Discussion paper series on the coherence between institutions and technologies in infrastructures2010

Simulation of High-Performance Memory Allocators

David Atienza Alonso, José Luis Risco Martin

Current general-purpose memory allocators do not provide sufficient speed or flexibility for modern highperformance applications. To optimize metrics like performance, memory usage and energy consumption, software engineers often write custom allocators fr ...

IEEE Press2010

Simulation of High-Performance Memory Allocators

David Atienza Alonso, José Luis Risco Martin

IEEE2010

Formalizing and verifying transactional memories

Vasu Singh

Transactional memory (TM) has shown potential to simplify the task of writing concurrent programs. TM shifts the burden of managing concurrency from the programmer to the TM algorithm. The correctness of TM algorithms is generally proved manually. The goal ...

EPFL2010

Stochastic Simulations in Systems Biology

Marc Hafner, Heinz Köppl

With the advances in measurement technology for molecular biology, predictive mathematical models of cellular processes come in reach. A large fraction of such models addresses the kinetics of interaction between biomolecules such as proteins, transcriptio ...

IGI Global2010

A Parallel Evolutionary Algorithm to Optimize Dynamic Memory Managers in Embedded Systems

David Atienza Alonso, José Luis Risco Martin

For the last 30 years, several dynamic memory managers (DMMs) have been proposed. Such DMMs include first fit, best fit, segregated fit and buddy systems. Since the performance, memory usage and energy consumption of each DMM differs, software engineers of ...

Elsevier2010

Constitutive modeling of unsaturated aggregated soils

Lyesse Laloui, Laurent Vulliet, Azad Koliji

A coupled water retention-mechanical constitutive model for unsaturated aggregated soils is presented here. Based on the multi-scale experimental results, the model incorporates the inter-particle bonding, fabric and partial saturation effects in a single ...

2010

Transactions in the Jungle

Rachid Guerraoui, Michal Kapalka, Vasu Singh

Transactional memory (TM) has shown potential to simplify the task of writing concurrent programs. Inspired by classical work on databases, formal definitions of the semantics of TM executions have been proposed. Many of these definitions assumed that acce ...

Acm Order Department2010

Software Transactional Memory on Relaxed Memory Models

Rachid Guerraoui, Vasu Singh

Pseudo-code descriptions of STMs assume sequentially consistent program execution and atomicity of high-level STM operations like read, write, and commit. These assumptions are often violated in realistic settings, as STM implementations run on relaxed mem ...

Springer2009

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