Publications associées à Multiversion Concurrency Control

The PCL Theorem. Transactions cannot be Parallel, Consistent and Live.

Rachid Guerraoui, Victor Bushkov, Panagiota Fatourou

We show that it is impossible to design a transactional memory system which ensures parallelism, i.e. transactions do not need to synchronize unless they access the same application objects, while ensuring very little consistency, i.e. a consistency condit ...

2014

Scaling up Mixed Workloads: a Battle of Data Freshness, Flexibility, and Scheduling

Anastasia Ailamaki, Iraklis Psaroudakis

The common "one size does not fit all" paradigm isolates transactional and analytical workloads into separate, specialized database systems. Operational data is periodically replicated to a data warehouse for analytics. Competitiveness of enterprises today ...

Springer International Publishing AG2014

Clock-SI: Snapshot Isolation for Partitioned Data Stores Using Loosely Synchronized Clocks

Willy Zwaenepoel, Sameh Mohamed Elnikety, Jiaqing Du

Clock-SI is a fully distributed protocol that implements snapshot isolation (SI) for partitioned data stores. It derives snapshot and commit timestamps from loosely synchronized clocks, rather than from a centralized timestamp authority as used in current ...

2013

Scaling up analytical queries with column-stores

Anastasia Ailamaki, Ioannis Alagiannis, Manoussos Gavriil Athanassoulis

As data analytics is used by an increasing number of applications, data analytics engines are required to execute workloads with increased concurrency, i.e., an increasing number of clients submitting queries. Data management systems designed for data anal ...

2013

Everything You Always Wanted to Know about Synchronization but Were Afraid to Ask

Rachid Guerraoui, Vasileios Trigonakis, Tudor Alexandru David

This paper presents the most exhaustive study of synchronization to date. We span multiple layers, from hardware cache-coherence protocols up to high-level concurrent software. We do so on different types of architectures, from single-socket - uniform and ...

2013

Task Scheduling for Highly Concurrent Analytical and Transactional Main-Memory Workloads

Anastasia Ailamaki, Iraklis Psaroudakis

Task scheduling typically employs a worker thread per hardware context to process a dynamically changing set of tasks. It is an appealing solution to exploit modern multi-core processors, as it eases parallelization and avoids unnecessary context switches ...

2013

Sharing Data and Work Across Concurrent Analytical Queries

Anastasia Ailamaki, Manoussos Gavriil Athanassoulis, Iraklis Psaroudakis

Today's data deluge enables organizations to collect massive data, and analyze it with an ever-increasing number of concurrent queries. Traditional data warehouses (DW) face a challenging problem in executing this task, due to their query-centric model: ea ...

2013

How to Allocate Tasks Asynchronously

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Asynchronous task allocation is a fundamental problem in distributed computing, in which p asyn- chronous processes must execute a set of m tasks. Also known as write-all or do-all, this problem been studied extensively, both independently and as a key bui ...

2012

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.

Multiversion Concurrency Control

The PCL Theorem. Transactions cannot be Parallel, Consistent and Live.

Transactions Chasing Scalability and Instruction Locality on Multicores

Scaling up Mixed Workloads: a Battle of Data Freshness, Flexibility, and Scheduling

Clock-SI: Snapshot Isolation for Partitioned Data Stores Using Loosely Synchronized Clocks

Scaling up analytical queries with column-stores

Collaborative Monocular SLAM with Multiple Micro Aerial Vehicles

Everything You Always Wanted to Know about Synchronization but Were Afraid to Ask

Task Scheduling for Highly Concurrent Analytical and Transactional Main-Memory Workloads

Sharing Data and Work Across Concurrent Analytical Queries

How to Allocate Tasks Asynchronously

Graph Chatbot

Chattez avec Graph Search

Scaling up Mixed Workloads: a Battle of Data Freshness, Flexibility, and Scheduling

Transactions Chasing Scalability and Instruction Locality on Multicores

Scaling up analytical queries with column-stores

Collaborative Monocular SLAM with Multiple Micro Aerial Vehicles

The PCL Theorem. Transactions cannot be Parallel, Consistent and Live.

Task Scheduling for Highly Concurrent Analytical and Transactional Main-Memory Workloads

Everything You Always Wanted to Know about Synchronization but Were Afraid to Ask

Sharing Data and Work Across Concurrent Analytical Queries

Clock-SI: Snapshot Isolation for Partitioned Data Stores Using Loosely Synchronized Clocks

How to Allocate Tasks Asynchronously