Publications related to Combining Compile-Time and Run-Time Support for Efficient Distributed Shared Memory

Speculative Linearizability

Rachid Guerraoui, Viktor Kuncak, Giuliano Losa

Linearizability is a key design methodology for reasoning about implementations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusion that operations execute sequentially and fault-free, despite the a ...

Assoc Computing Machinery2012

On the cost of composing shared-memory algorithms

Rachid Guerraoui, Dan Alistarh, Giuliano Losa

Decades of research in distributed computing have led to a variety of perspectives on what it means for a concurrent algorithm to be efficient, depending on model assumptions, progress guarantees, and complexity metrics. It is therefore natural to ask whet ...

ACM Press2012

StagedSAC: a case study in performance-oriented DSL development

Martin Odersky, Tiark Rompf, Vlad Ureche, Hassan Chafi

Domain-specific languages (DSLs) can bridge the gap between high-level programming and efficient execution. However, implementing compiler tool-chains for performance oriented DSLs requires significant effort. Recent research has produced methodologies and ...

ACM2011

Speculative Linearizability

Rachid Guerraoui, Viktor Kuncak, Giuliano Losa

Linearizability is a key design methodology for reasoning about implementations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusion that operations execute sequentially and fault-free, despite the a ...

2011

Émulation de mémoire partagée en environnements distribués dynamiques

Vincent Gramoli

Most distributed systems are large-scale and dynamic. Communication has thus become a critical issue and the shared memory, which is a reliable paradigm of communication, allow distributed nodes to exchange information through read and write operations. In ...

2011

Verification of STM on relaxed memory models

Rachid Guerraoui, Vasu Singh

Software transactional memories (STM) are described in the literature with assumptions of sequentially consistent program execution and atomicity of high level operations like read, write, and abort. However, in a realistic setting, processors use relaxed ...

Springer Verlag2011

The disagreement power of an adversary

Rachid Guerraoui

At the heart of distributed computing lies the fundamental result that the level of agreement that can be obtained in an asynchronous shared memory model where t processes can crash is exactly t + 1. In other words, an adversary that can crash any subset o ...

2011

Significance Driven Computation on Next-Generation Unreliable Platforms

Vaibhav Gupta, Georgios Karakonstantis

In this paper, we propose a design paradigm for energy efficient and variation-aware operation of next-generation multicore heterogeneous platforms. The main idea behind the proposed approach lies on the observation that not all operations are equally impo ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2011

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

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

IEEE2010

Combining Compile-Time and Run-Time Support for Efficient Distributed Shared Memory

Graph Chatbot

Chat with Graph Search

Speculative Linearizability

On the cost of composing shared-memory algorithms

StagedSAC: a case study in performance-oriented DSL development

Speculative Linearizability

Émulation de mémoire partagée en environnements distribués dynamiques

Verification of STM on relaxed memory models

The disagreement power of an adversary

Significance Driven Computation on Next-Generation Unreliable Platforms

Simulation of High-Performance Memory Allocators

Simulation of High-Performance Memory Allocators

Simulation of High-Performance Memory Allocators

Speculative Linearizability

StagedSAC: a case study in performance-oriented DSL development

Significance Driven Computation on Next-Generation Unreliable Platforms

Verification of STM on relaxed memory models

On the cost of composing shared-memory algorithms

Émulation de mémoire partagée en environnements distribués dynamiques

Speculative Linearizability

The disagreement power of an adversary

Simulation of High-Performance Memory Allocators