211
Go's work-stealing scheduler
Deep dive into how scheduler works
212
Recommendations about coding in C++
Find software and development products, explore tools and technologies, connect with other developers and more. Sign up to manage your products.
213
Hash indexes are faster than btree indexes?
PostgreSQL have supported Hash Index for a long time, but they are not much used in production mainly because they are not durable. Now, ...
214
An ode to pack: gzip’s forgotten decompressor
The latest 4.13.9 source release of the Linux kernel is 780MiB, but thanks to xz compression, the download is a much more managable 96 MiB (an 88% reduction)
215
Raw Linux Threads via System Calls (2015)
Linux has an elegant and beautiful design when it comes to threads: threads are nothing more than processes that share a virtual address space and file descriptor table. Threads spawned by a process are additional child processes of the main “thread’s” parent process. They’re manipulated through the same process…
216
A Bourne-style shell built from scratch in 35 minutes [video]
We build a shell in the style of the Bourne shell, Bash, zsh, etc. It supports (1) running commands with arbitrarily many arguments, (2) quoting those arguments, and (3) combining the commands into arbitrarily long pipelines where the output of one command becomes the input of the next. This requires writing a parser…
217
Exploiting the Linux kernel via packet sockets
Guest blog post, posted by Andrey KonovalovIntroductionLately I’ve been spending some time ...
218
Using JDK 9 Memory Order Modes
This guide is mainly intended for expert programmers familiar with Java concurrency, but unfamiliar with the memory order modes available in JDK 9 provided by VarHandles. Mostly, it focuses on how to think about modes when developing parallel software. Feel free to first read the Summary .
219
Blender Cycles Turbocharged: how we made rendering 10x faster
Blender Studio is a web service that provides access the training videos and all the data from the Blender open projects.
220
What Happens to OO When Processors Are Free? (2015)
A while ago, I presented as a crazy thought experiment the idea of using Montecito's transistor budget for creating a chip with tens of tho...
221
Microsoft didn’t sandbox Windows Defender, so I did
Microsoft exposed their users to a lot of risks when they released Windows Defender without a sandbox. This surprised me. Sandboxing is one of the most effective security-hardening techniques. Why did Microsoft sandbox other high-value attack surfaces such as the JIT code in Microsoft Edge, but leave Windows Defender…
222
How to Design a Scalable Rate Limiting Algorithm
What is rate limiting? Navigate through the pros and cons of the available algorithms and best practices for how to design scalable rate limiting in Kong API.
223
224
Green Threads Explained
A short and self contained explanation that will guide you through an implementation of user threads.
225
226
ReactOS 0.4.5 Released
ReactOS is a free, opensource reimplementation of windows
227
The evolution of Unix architecture in two diagrams
Today I put online two diagrams depicting the architecture of the Unix operating system , one for the 1972 First Research Edition and one for FreeBSD, one of its direct descendants. Here are the details on how I created these diagrams.
228
Unikernels are secure
Per Buer is the CEO of IncludeOS . IncludeOS is a clean-slate unikernel written in C++ with performance and security in mind. Per Buer is the founder and previous CEO/CTO of Varnish Software.
229
Writing a Unix Shell
Building your own UNIX shell in parts. This post focuses on the semantics of the fork system call.
230
Reproducing Go binaries byte by byte
Fully reproducible builds are important because they bridge the gap between auditable open source and convenient binary artifacts. Technologies like TUF and Binary Transparency provide accountability for what binaries are shipped to users, but that’s of limited utility if there is no way (short of reverse engineering)…
231
232
Atom's new concurrency-friendly buffer implementation
We are archiving Atom and all projects under the Atom organization for an official sunset on December 15, 2022.
233
How Algolia Reduces Latency
Discover the tech stack used by Algolia. Explore 15 tools across 4 categories.
234
Are Jump Tables Always Fastest?
tl;dr: I make a petty point about premature optimization; don't go out and rewrite your switch statements as binary searches by hand; maybe do rewrite your jump tables as switch statements, though.
235
LogDevice: a distributed data store for logs
Visit the post for more.
236
237
Exploiting the Wi-Fi Stack on Apple Devices
Posted by Gal Beniamini, Project ZeroEarlier this year we performed research into Broadcom’...
238
HTTP/2 is not the future, it’s the present
Remember, in `may 1996`, the very first HTTP protocol version (HTTP/1.0) was born.
239
An adventure in trying to optimize math.Atan2 with Go assembly
This is a recount of an adventure where I experimented with some Go assembly coding in trying to optimize the math.Atan2 function.
240
Designing a Lock-free, Wait-free Hash Map
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 …