Alexandria Library

A curated collection of awesome articles

Here are some ressources related to Sorting, Hash, Threads. Hoping you will find learning material, alternative tools or just some interesting stuff.

Home > Programming, Machine Learning, Quan... > Programming, Memory Management, Com... > .NET, Performance, Multithreading, ... > Sorting, Hash, Threads

Articles

A Flexible Type System for Fearless Concurrency (2022) [pdf]

See discussion (34 comments, 141 points) - Archive

Implementing Value Speculation in OCaml

See discussion (12 comments, 114 points) - Archive

llama.cpp: Roadmap May 2023

See discussion (6 comments, 97 points) - Archive

Haiku's (Kernel) Condition Variables API: Design and Implementation

See discussion (16 comments, 121 points) - Archive

Overhead of Returning Optional Values in Java and Rust (2021)

See discussion (158 comments, 179 points) - Archive

AVX 512 will be the future

See discussion (271 comments, 203 points) - Archive

Inside boost::unordered_flat_map

See discussion (44 comments, 118 points) - Archive

Qt signal is ten times slower than a virtual function

See discussion (141 comments, 101 points) - Archive

Swift Proposal: Move Function

See discussion (99 comments, 98 points) - Archive

The true cost of linked lists

See discussion (255 comments, 251 points) - Archive

Modern programming languages require generics

See discussion (236 comments, 242 points) - Archive

Criticizing Hare language approach for generic data structures

See discussion (265 comments, 151 points) - Archive

Wasmer 2.2

See discussion (27 comments, 98 points) - Archive

Static B-Trees: A data structure for faster binary search

See discussion (49 comments, 306 points) - Archive

Hoare’s Rebuttal and Bubble Sort’s Comeback

See discussion (53 comments, 103 points) - Archive

Prefix sum on portable compute shaders

See discussion (15 comments, 116 points) - Archive

Do Low-Level Optimizations Matter? (2020)

See discussion (62 comments, 134 points) - Archive

Swift Actors: A practical example, part 1

See discussion (36 comments, 104 points) - Archive

Swift Evolution: Actors

See discussion (154 comments, 264 points) - Archive

How We Test Concurrent Primitives in Kotlin Coroutines

See discussion (5 comments, 123 points) - Archive

Beating Up on Qsort (2019)

See discussion (10 comments, 81 points) - Archive

Swift Atomics

See discussion (37 comments, 209 points) - Archive

A Concurrency Cost Hierarchy

See discussion (26 comments, 147 points) - Archive

Pony, Actors, Causality, Types, and Garbage Collection

See discussion (29 comments, 83 points) - Archive

Binary Search: A new implementation that is up to 25% faster

See discussion (54 comments, 171 points) - Archive

Hoare’s Rebuttal and Bubble Sort’s Comeback

See discussion (48 comments, 147 points) - Archive

Show HN: Tail Recursion Optimization for the JVM

See discussion (38 comments, 107 points) - Archive

Mutexes are faster than Spinlocks

See discussion (145 comments, 373 points) - Archive

Common Systems Programming Optimizations and Tricks

See discussion (94 comments, 375 points) - Archive

Shenanigans With Hash Tables

See discussion (23 comments, 138 points) - Archive

Should array length be stored into a local variable in C#?

See discussion (68 comments, 94 points) - Archive

Why is it faster to process a sorted array than an unsorted array? (2012)

See discussion (18 comments, 83 points) - Archive

Performance of nnn vs. ls

See discussion (57 comments, 84 points) - Archive

On lists, cache, algorithms, and microarchitecture

See discussion (14 comments, 167 points) - Archive

How many ways are there to sort GUIDs?

See discussion (48 comments, 93 points) - Archive

Pessimism about parallelism

See discussion (118 comments, 100 points) - Archive

Augmenting Agile with Formal Methods

See discussion (15 comments, 112 points) - Archive

Exploring .NET Core platform intrinsics: Part 4 – Alignment and pipelining

See discussion (7 comments, 107 points) - Archive

Quicksort in Idris

See discussion (25 comments, 90 points) - Archive

The Current State of Java Value Types

See discussion (43 comments, 83 points) - Archive

A new fast hash table in response to Google’s new fast hash table

See discussion (115 comments, 390 points) - Archive

Are Jump Tables Always Fastest?

See discussion (34 comments, 188 points) - Archive

Why is it faster to process a sorted array than an unsorted array? (2012)

See discussion (97 comments, 329 points) - Archive

Concurrency in Swift: One possible approach

See discussion (103 comments, 188 points) - Archive

The slow currentTimeMillis()

See discussion (52 comments, 323 points) - Archive

Common Multithreading Mistakes in C# – Unsafe Assumptions

See discussion (78 comments, 203 points) - Archive

Writing a Faster Sorting Algorithm

See discussion (33 comments, 201 points) - Archive

Think Before You Parallelize: A tour of parallel abstractions

See discussion (48 comments, 188 points) - Archive

Hash Functions all the way down

See discussion (30 comments, 148 points) - Archive

Locking in WebKit

See discussion (40 comments, 121 points) - Archive

Sort Faster with FPGAs

See discussion (38 comments, 86 points) - Archive

Cache-friendly binary search

See discussion (13 comments, 81 points) - Archive

Swift: Madness of Generic Integer

See discussion (75 comments, 148 points) - Archive

Lampsort: Leslie Lamport's Non-recursive Quicksort

See discussion (44 comments, 93 points) - Archive

Fast immutable vectors in C#

See discussion (24 comments, 119 points) - Archive

Secrets of dispatch_once; x86 performance trickery

See discussion (31 comments, 107 points) - Archive

Value Types for Java – A sketch of proposed enhancements

See discussion (98 comments, 121 points) - Archive

An immutable operating system

See discussion (150 comments, 286 points) - Archive

The cost of dynamic vs. static dispatch in C++

See discussion (70 comments, 125 points) - Archive

How I Got a 2x Speedup With One Line of Code

See discussion (56 comments, 216 points) - Archive

Haskell Beats C Using Generalized Stream Fusion [pdf]

See discussion (67 comments, 108 points) - Archive

Java's Atomic and volatile, under the hood on x86

See discussion (21 comments, 105 points) - Archive

What’s really so bad about bubble sort?

See discussion (58 comments, 133 points) - Archive

Why is processing a sorted array faster than an unsorted array?

See discussion (119 comments, 590 points) - Archive

Why we didn't use a bloom filter

See discussion (36 comments, 102 points) - Archive

Hidden Features of Java

See discussion (23 comments, 125 points) - Archive

When would you ever want bubblesort?

See discussion (65 comments, 92 points) - Archive

The Performance Impact of C++'s `final` Keyword

See discussion (267 comments, 247 points) - Archive

GPU compute in the browser at the speed of native: WebGPU marching cubes

See discussion (53 comments, 168 points) - Archive

Swift's native Clocks are inefficient

See discussion (115 comments, 141 points) - Archive

B-Trees Require Fewer Comparisons Than Balanced Binary Search Trees

See discussion (74 comments, 191 points) - Archive

Gpu.cpp: A lightweight library for portable low-level GPU computation

See discussion (52 comments, 242 points) - Archive

C++'s `noexcept` can sometimes help or hurt performance

See discussion (163 comments, 100 points) - Archive

Do low-level optimizations matter? Faster quicksort with cmov (2020)

See discussion (75 comments, 174 points) - Archive