Articles on Shlomi Steinberg

Fast Complex Error Function and Faddeeva Function

Mon, 29 Jul 2019 04:08:11 +0000

While the real error function is easy to approximate and is available in C++ standard library, the imaginary and complex valued error functions are neither.

Fast, Shared, Upgradeable Mutex

Sun, 24 Jun 2018 04:25:42 +0000

Mutex operations are generally expensive on modern architectures and impose harsh limits on the concurrent throughput and scalability of an algorithm or system. Nonetheless mutual exclusion is easy to understand, widely applicable and is a prevailing method of solving resource sharing in concurrent systems.

Designing a Lock-Free, Wait-Free Hash Map

Mon, 28 Sep 2015 19:25:37 +0000

Wait-free algorithms attract vast interest and are an area of intense research, the motivation being that true lock-free algorithms and data structures provide great benefits in terms of performance and scalability over lock-based variants. However designing lock-free systems isn’t a simple matter.