Elastic Transactions

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

The design and implementation of efficient concurrent data structures has seen significant attention. However, most of this work has focused on concurrent data structures providing good worst-case guarantees, although, in real workloads, objects are often ...

This paper discusses the influence of fiber orientation on elastic limit tensile stress of ultra-high performance fiber reinforced cementitious composites (UHPFRC). An original model relating elastic limit tensile stress to fiber orientation is proposed, a ...

As it has become easier and cheaper to collect big datasets in the last few decades, designing efficient and low-cost algorithms for these datasets has attracted unprecedented attention. However, in most applications, even storing datasets as acquired has ...

The metric dimension of a graph G is the minimal size of a subset R of vertices of G that, upon reporting their graph distance from a distinguished (source) vertex v⋆, enable unique identification of the source vertex v⋆ among all possible vertices of G. I ...

In the localization game on a graph, the goal is to find a fixed but unknown target node v* with the least number of distance queries possible. In the j-th step of the game, the player queries a single node v_j and receives, as an answer to their query, th ...

The aim of this work is the investigation of mesoscale/local variability in mechanical properties of clear timber in the radial direction. Clear Norway spruce wood, Picea abies, was used for cutting specimens of different lengths with a small cross-section ...

The use of transactions in distributed systems dates back to the 70's. The last decade has also seen the proliferation of transactional systems. In the existing transactional systems, many protocols employ a centralized approach in executing a distributed ...

We present multiversion timestamp locking (MVTL), a new genre of multiversion concurrency control algorithms for serializable transactions. The key idea behind MVTL is simple: lock individual timestamps instead of locking objects. After presenting a generi ...

This paper presents elastic transactions, an appealing alternative to traditional transactions, in particular to implement search structures in shared memory multicore architectures. Upon conflict detection, an elastic transaction might drop what it did so ...

The atomic commit problem lies at the heart of distributed database systems. The problem consists for a set of processes (database nodes) to agree on whether to commit or abort a transaction (agreement property). The commit decision can only be taken if al ...

The increase in the number of cores in processors has been an important trend over the past decade. In order to be able to efficiently use such architectures, modern software must be scalable: performance should increase proportionally to the number of all ...

Reversible deformation is a unique property of elastic materials. Here, we design and fabricate highly stretchable multilayered films by patterning Y-shaped motifs through films of non- elastic materials, e.g. plastics, metals, ceramics. By adjusting the g ...

Index join performance is determined by the efficiency of the lookup operation on the involved index. Although database indexes are highly optimized to leverage processor caches, main memory accesses inevitably increase lookup runtime when the index outsiz ...

We argue that there is virtually no practical situation in which one should seek a "theoretically wait-free" algorithm at the expense of a state-of-the-art blocking algorithm in the case of search data structures: blocking algorithms are simple, fast, and ...

The present invention relates to a cantilever or membrane comprising a body and an elongated beam attached to the body. The elongated beam includes a first layer comprising a first material, a second layer comprising a second material having an elastic mod ...

Lexicographic Boolean satisfiability (LEXSAT) is a variation of the Boolean satisfiability problem (SAT). Given a variable order, LEXSAT finds a satisfying assignment whose integer value under the given variable order is minimum (maximum) among all satisfi ...

A Digital Pixel Sensor (DPS) based CMOS camera configured to record frames and comprising an event detection sensor configured to look for an event happening in a determined frame, comprising an array of event detection pixels, a first reference voltage ge ...

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

This thesis explores the use of specifications for the construction of correct programs. We go beyond their standard use as run-time assertions, and present algorithms, techniques and implementations for the tasks of 1) program verification, 2) declarative ...

We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-speculative) accesses to have a bounded complexity. Researchers tried to evaluate t ...

Elastic Transactions

Chat with Graph Search

The splay-list: a distribution-adaptive concurrent skip-list

Elastic limit tensile stress of UHPFRC: Method of determination and effect of fiber orientation

Sketches, metrics and fast algorithms

Metric dimension of critical Galton–Watson trees and linear preferential attachment trees

Sequential metric dimension for random graphs

Experimental investigation of mesoscale variability of clear spruce mechanical properties in the radial direction

The Complexity of Reliable and Secure Distributed Transactions

Locking Timestamps versus Locking Objects

Elastic transactions

How Fast can a Distributed Transaction Commit?

Universally Scalable Concurrent Data Structures

Engineering reversible elasticity in ductile and brittle thin films supported by a plastic foil

Interleaving with Coroutines: A Practical Approach for Robust Index Joins

Concurrent Search Data Structures Can Be Blocking and Practically Wait-Free

Multilayer mems cantilevers

Fast generation of lexicographic satisfiable assignments: enabling canonicity in SAT-based applications

A novel cmos image sensor with event/change detection and reduced data redundancy

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

Programming with Specifications

A Speculation-Friendly Binary Search Tree