Publications related to Non-blocking algorithm

A Standalone FPGA-Based Miner for Lyra2REv2 Cryptocurrencies

Alexios Konstantinos Balatsoukas Stimming, Pascal Giard, Michiel Van Beirendonck

Lyra2REv2 is a hashing algorithm that consists of a chain of individual hashing algorithms, and it is used as a proof-of-work function in several cryptocurrencies. The most crucial and exotic hashing algorithm in the Lyra2REv2 chain is a specific instance ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

PaRiS: Causally Consistent Transactions with Non-blocking Reads and Partial Replication

Willy Zwaenepoel, Diego Didona, Kristina Spirovska

Geo-replicated data platforms are at the backbone of several large-scale online services. Transactional Causal Consistency (TCC) is an attractive consistency level for building such platforms. TCC avoids many anomalies of eventual consistency, eschews the ...

2019

Lock-Unlock: Is That All? A Pragmatic Analysis of Locking in Software Systems

Rachid Guerraoui, Vasileios Trigonakis

A plethora of optimized mutex lock algorithms have been designed over the past 25 years to mitigate performance bottlenecks related to critical sections and locks. Unfortunately, there is currently no broad study of the behavior of these optimized lock alg ...

2019

OneFile: A Wait-free Persistent Transactional Memory

Nachshon Cohen, Pascal Felber

A persistent transactional memory (PTM) library provides an easy-to-use interface to programmers for using byte-addressable non-volatile memory (NVM). Previously proposed PTMs have, so far, been blocking. We present OneFile, the first wait-free PTM with in ...

IEEE COMPUTER SOC2019

PaRiS: Causally Consistent Transactions with Non-blocking Reads and Partial Replication

Willy Zwaenepoel, Diego Didona, Kristina Spirovska

Geo-replicated data platforms are the backbone of several large-scale online services. Transactional Causal Consistency (TCC) is an attractive consistency level for building such platforms. TCC avoids many anomalies of eventual consistency, eschews the syn ...

IEEE COMPUTER SOC2019

Stop Crying Over Your Cache Miss Rate: Handling Efficiently Thousands of Outstanding Misses in FPGAs

Paolo Ienne, Mikhail Asiatici

FPGAs rely on massive datapath parallelism to accelerate applications even with a low clock frequency. However, applications such as sparse linear algebra and graph analytics have their throughput limited by irregular accesses to external memory for which ...

ASSOC COMPUTING MACHINERY2019

Speculative Dataflow Circuits

Paolo Ienne, Andrea Guerrieri, Lana Josipovic

With FPGAs facing broader application domains, the conversion of imperative languages into dataflow circuits has been recently revamped as a way to overcome the conservatism of statically scheduled high-level synthesis. Apart from the ability to extract pa ...

ASSOC COMPUTING MACHINERY2019

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

Rachid Guerraoui, Victor Bushkov, Panagiota Fatourou

We establish a theorem called the PCL theorem, which states that it is impossible to design a transactional memory algorithm that ensures (1) parallelism, i.e., transactions do not need to synchronize unless they access the same application objects, (2) ve ...

ASSOC COMPUTING MACHINERY2019

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.

Non-blocking algorithm

A Standalone FPGA-Based Miner for Lyra2REv2 Cryptocurrencies

PaRiS: Causally Consistent Transactions with Non-blocking Reads and Partial Replication

Lock-Unlock: Is That All? A Pragmatic Analysis of Locking in Software Systems

OneFile: A Wait-free Persistent Transactional Memory

PaRiS: Causally Consistent Transactions with Non-blocking Reads and Partial Replication

Stop Crying Over Your Cache Miss Rate: Handling Efficiently Thousands of Outstanding Misses in FPGAs

Speculative Dataflow Circuits

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

Every data structure deserves lock-free memory reclamation

Scalable Synchronization in Shared-Memory Systems: Extrapolating, Adapting, Tuning

Graph Chatbot

Chat with Graph Search

A Standalone FPGA-Based Miner for Lyra2REv2 Cryptocurrencies

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

PaRiS: Causally Consistent Transactions with Non-blocking Reads and Partial Replication

OneFile: A Wait-free Persistent Transactional Memory

PaRiS: Causally Consistent Transactions with Non-blocking Reads and Partial Replication

Stop Crying Over Your Cache Miss Rate: Handling Efficiently Thousands of Outstanding Misses in FPGAs

Scalable Synchronization in Shared-Memory Systems: Extrapolating, Adapting, Tuning

Lock-Unlock: Is That All? A Pragmatic Analysis of Locking in Software Systems

Speculative Dataflow Circuits

Every data structure deserves lock-free memory reclamation