Skip to main content

Sasa.Atomics - Simpler, More Scalable Atomic Operations

This is the nineteenth post in my ongoing series covering the abstractions in Sasa. Previous posts:

The System.Threading namespace contains a number of useful abstractions for concurrent programming. The Interlocked static class in particular ought to be in every programmer's toolbox. However, the CompareExchange API doesn't always lend itself to the cleanest algorithms. Furthermore, under medium to high contention, even atomic compare-and-swap operations don't scale well.

Enter Sasa.Atomics, which provides a simpler API for atomic operations and implements the lightweight contention management scheme from the paper described above. Constant backoff contention management requires no state, and incurs virtually no overhead in low contention scenarios, and it scales quite well under medium to high contention.

Sasa.Atomics.Set

Sasa.Atomics.Set is a set of extension methods which perform a compare-and-exchange operation, and return true if the operation succeeds:

string o = "hello";
...
if (Atomics.Set(ref o, o + " world!", o))
    Console.WriteLine(o);
// output:
// hello world!

Sasa.Atomics.SetFailed

Sasa.Atomics.Set is a set of extension methods which perform a compare-and-exchange operation, and return true if the operation fails:

string o = "hello";
...
while (Atomics.SetFailed(ref o, o + " world!", o)) { }
// output:
// hello world!

Comments

Popular posts from this blog

async.h - asynchronous, stackless subroutines in C

The async/await idiom is becoming increasingly popular. The first widely used language to include it was C#, and it has now spread into JavaScript and Rust. Now C/C++ programmers don't have to feel left out, because async.h is a header-only library that brings async/await to C! Features: It's 100% portable C. It requires very little state (2 bytes). It's not dependent on an OS. It's a bit simpler to understand than protothreads because the async state is caller-saved rather than callee-saved. #include "async.h" struct async pt; struct timer timer; async example(struct async *pt) { async_begin(pt); while(1) { if(initiate_io()) { timer_start(&timer); await(io_completed() || timer_expired(&timer)); read_data(); } } async_end; } This library is basically a modified version of the idioms found in the Protothreads library by Adam Dunkels, so it's not truly ground bre...

Easy Automatic Differentiation in C#

I've recently been researching optimization and automatic differentiation (AD) , and decided to take a crack at distilling its essence in C#. Note that automatic differentiation (AD) is different than numerical differentiation . Math.NET already provides excellent support for numerical differentiation . C# doesn't seem to have many options for automatic differentiation, consisting mainly of an F# library with an interop layer, or paid libraries . Neither of these are suitable for learning how AD works. So here's a simple C# implementation of AD that relies on only two things: C#'s operator overloading, and arrays to represent the derivatives, which I think makes it pretty easy to understand. It's not particularly efficient, but it's simple! See the "Optimizations" section at the end if you want a very efficient specialization of this technique. What is Automatic Differentiation? Simply put, automatic differentiation is a technique for calcu...

Easy Reverse Mode Automatic Differentiation in C#

Continuing from my last post on implementing forward-mode automatic differentiation (AD) using C# operator overloading , this is just a quick follow-up showing how easy reverse mode is to achieve, and why it's important. Why Reverse Mode Automatic Differentiation? As explained in the last post, the vector representation of forward-mode AD can compute the derivatives of all parameter simultaneously, but it does so with considerable space cost: each operation creates a vector computing the derivative of each parameter. So N parameters with M operations would allocation O(N*M) space. It turns out, this is unnecessary! Reverse mode AD allocates only O(N+M) space to compute the derivatives of N parameters across M operations. In general, forward mode AD is best suited to differentiating functions of type: R → R N That is, functions of 1 parameter that compute multiple outputs. Reverse mode AD is suited to the dual scenario: R N → R That is, functions of many parameters t...