1712.01044.pdf
1.6 MB
Reclaiming Memory for Lock-Free Data Structures:
There has to be a Better Way
There has to be a Better Way
👍1
Positive Supercompilation for a Higher Order Call-by-value Language
https://arxiv.org/pdf/1005.5278.pdf
https://arxiv.org/pdf/1005.5278.pdf
👍1
The Expression Problem, Trivially!
https://i.cs.hku.hk/~bruno/papers/Modularity2016.pdf
https://i.cs.hku.hk/~bruno/papers/Modularity2016.pdf
Souper: a superoptimizer for LLVM IR. It uses an SMT solver to help identify missing peephole optimizations in LLVM's midend optimizers.https://github.com/google/souper
GitHub
GitHub - google/souper: A superoptimizer for LLVM IR
A superoptimizer for LLVM IR. Contribute to google/souper development by creating an account on GitHub.
👍1
Writing custom C++20 coroutine systems
https://www.chiark.greenend.org.uk/~sgtatham/quasiblog/coroutines-c++20/
https://www.chiark.greenend.org.uk/~sgtatham/quasiblog/coroutines-c++20/
Philosophy of coroutines
https://www.chiark.greenend.org.uk/~sgtatham/quasiblog/coroutines-philosophy/
https://www.chiark.greenend.org.uk/~sgtatham/quasiblog/coroutines-philosophy/
Rethinking Supercompilation
https://ndmitchell.com/downloads/paper-rethinking_supercompilation-29_sep_2010.pdf
https://ndmitchell.com/downloads/paper-rethinking_supercompilation-29_sep_2010.pdf
❤1👍1
A not-so-quick introduction to the C++ allocator model
https://quuxplusone.github.io/blog/2023/06/02/not-so-quick-pmr/
https://quuxplusone.github.io/blog/2023/06/02/not-so-quick-pmr/
Arthur O’Dwyer
A not-so-quick introduction to the C++ allocator model
My paper P1144R8 “std::is_trivially_relocatable”
has, in the past few months, been joined by three(!) papers out of Bloomberg:
has, in the past few months, been joined by three(!) papers out of Bloomberg:
The Power of Prolog
https://www.metalevel.at/prolog/facets
https://www.metalevel.at/prolog/facets
www.metalevel.at
Facets of Prolog
N-Queens Problem in Prolog
https://youtu.be/l_tbL9RjFdo?si=7-au55mZ9pvvs5B0
https://youtu.be/l_tbL9RjFdo?si=7-au55mZ9pvvs5B0
YouTube
N-Queens in Prolog
Prolog lets us easily find solutions for this famous puzzle, also for quite large boards. Notably, we can use the same program to test, complete and generate solutions. The code is available from: https://www.metalevel.at/queens/
👍1
How FoundationDB works and why it works
https://blog.the-pans.com/notes-on-the-foundationdb-paper
https://blog.the-pans.com/notes-on-the-foundationdb-paper
Lu’s blog
How FoundationDB works and why it works
FoundationDB is a very impressive database. Its paper won the best industry paper award in SIGMOD’21. In this post, I will explain, in detail, how FDB works and discuss a few very interesting design choices they made. It’s a dense paper packed with neat ideas.…
When Zig Outshines Rust: Memory Efficient Enum Arrays
https://alic.dev/blog/dense-enums
https://alic.dev/blog/dense-enums
alic.dev
When Zig outshines Rust - Memory efficient enum arrays
Proper support for sum types or tagged unions have become table stakes for systems programming languages. However, they can incur a lot of memory fragmentation that's not trivial to avoid without good support for metaprogramming. This post goes into Zig's…
👎1🔥1
How Hard is it to Adapt a Memory Allocator to CHERI?
https://tratt.net/laurie/blog/2023/how_hard_is_it_to_adapt_a_memory_allocator_to_cheri.html
https://tratt.net/laurie/blog/2023/how_hard_is_it_to_adapt_a_memory_allocator_to_cheri.html
GCC Preparing To Introduce "-fhardened" Security Hardening Option
https://www.phoronix.com/news/GCC-fhardened-Hardening-Option
https://www.phoronix.com/news/GCC-fhardened-Hardening-Option
Phoronix
GCC Preparing To Introduce "-fhardened" Security Hardening Option
Following discussions among compiler developers and other stakeholders, the GNU Compiler Collection (GCC) is preparing to add a '-fhardened' compiler option that will enable various hardening features aimed at increasing the security/robustness of the generated…
Faster Integer Parsing
https://kholdstare.github.io/technical/2020/05/26/faster-integer-parsing.html
https://kholdstare.github.io/technical/2020/05/26/faster-integer-parsing.html
❤2