Publication

Scalability of write-ahead logging on multicore and multisocket hardware

Publications associées (135)

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

Transaction Polymorphism

Rachid Guerraoui, Vincent Gramoli

Concurrent implementations of abstract types usually rely on lock-free primitives or locks and are highly tuned to support a finite set of efficient operations. However, it is very hard to extend such types for specific needs by adding new operations. The ...

2011

Deadlock Immunity

Horatiu Jula

Deadlock immunity is a property by which programs, once afflicted by a deadlock, develop resistance against future occurrences of that deadlock. We enable real applications to automatically achieve immunity against deadlock bugs involving mutex locks, sema ...

EPFL2011

A Data-oriented Transaction Execution Engine and Supporting Tools

Anastasia Ailamaki, Miguel Sérgio De Oliveira Branco, Frederick Ryan Johnson, Pinar Tözün, Ippokratis Pandis, Danica Porobic, Dimitrios Karampinas

Conventional OLTP systems assign each transaction to a worker thread and that thread accesses data, depending on what the transaction dictates. This thread-to-transaction work assignment policy leads to unpredictable accesses. The unpredictability forces e ...

2011

Aether: A scalable approach to logging

Anastasia Ailamaki, Frederick Ryan Johnson, Manoussos Gavriil Athanassoulis, Ippokratis Pandis, Radu Ioan Stoica

The shift to multi-core hardware brings new challenges to database systems, as the software parallelism determines performance. Even though database systems traditionally accommodate simultaneous requests, a multitude of synchronization barriers serialize ...

2010

Theory of Transactional Memory

Michal Kapalka

Transactional memory (TM) is a promising paradigm for concurrent programming, in which threads of an application communicate, and synchronize their actions, via inmemory transactions. Each transaction can perform any number of operations on shared data, an ...

EPFL2010

Data-Oriented Transaction Execution

Anastasia Ailamaki, Frederick Ryan Johnson, Ippokratis Pandis

While hardware technology has undergone major advancements over the past decade, transaction processing systems have remained largely unchanged. The number of cores on a chip grows exponentially, following Moore's Law, allowing for an ever-increasing numbe ...

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

Leveraging Parallel Nesting in Transactional Memory

Rachid Guerraoui, Michal Kapalka, Aleksandar Dragojevic

Exploiting the emerging reality of affordable multi-core architectures goes through providing programmers with simple abstractions that would enable them to easily turn their sequential programs into concurrent ones that expose as much parallelism as possi ...

ACM2010

Decoupling contention management from scheduling

Anastasia Ailamaki, Frederick Ryan Johnson, Radu Ioan Stoica

Many parallel applications exhibit unpredictable communication between threads, leading to contention for shared objects. The choice of contention management strategy impacts strongly the performance and scalability of these applications: spinning provides ...

2010

Composition vs Concurrency

Rachid Guerraoui, Vincent Gramoli, Mihai Letia

Composing software is notoriously difficult, especially when it is concurrent. Two fine-grained locked operations may for instance easily deadlock upon composition. One of the most appealing features of transactions is, on the other hand, that they compose ...

2010