







The Linux syscall table for 38 architectures: every system call number, argument and register, with a table per architecture, from Linux 3.3 to 7.3.
x86 calling conventions
This article describes the calling conventions used when programming x86 architecture microprocessors.
Deterministic Core, Non-Deterministic Shell - Outdata
Determinism, architecture, and the de-sloppification of legacy code.
Compiling Models to Megakernels
Fine-grained synchronization, deep pipelines, and zero kernel launch overheads, automatically.

Vergilius Project
Take a look into the depths of Windows kernels and reveal more than 60000 undocumented structures.

Unix system programming in OCaml
Translation by Daniel C. Bünzli, Eric Cooper, Eliot Handelman, Priya Hattiangdi, Thad Meyer, Prashanth Mundkur, Richard Paradies, Till Varoquaux, Mark Wong-VanHaren
From bootloader to kernel
If you've read my earlier posts about assembly language for Linux x86_64, you might see that I started to get interested in low-level programming. I've written a set of articles on assembly programming for x86_64 Linux and, in parallel, began exploring the Linux kernel source ...

Codex OS is now Mutable OS! | Mutable OS
After years of development, Codex OS has been reborn as Mutable OS — a free, open-source, local-first environment for knowledge, creativity,

The seL4 Microkernel | seL4
seL4 is both the world's most highly assured and the world's fastest operating system kernel. Its uniqueness lies in the formal mathematical proof that it behaves exactly as specified, enforcing strong security boundaries for applications running on top of it while maintaining the high performance that deployed systems need.
p-code
Niklaus Wirth specified a simple p-code machine in the 1976 book Algorithms + Data Structures = Programs. The machine had 3 registers - a program counter p, a base register b, and a top-of-stack register t. There were 8 instructions:
Architecture decision record (ADR)
Architecture decision record (ADR) examples for software planning, IT leadership, and template documentation
Interrupt descriptor table
The interrupt descriptor table (IDT) is a data structure used by the x86 architecture to implement an interrupt vector table. The IDT is used by the processor to determine the memory addresses of the handlers to be executed on interrupts and exceptions.
How programs get run: ELF binaries
The previous article in this series described the general mechanisms that th [...]
Moving beyond fork() + exec()
Since the earliest days of Unix, two of the core process-oriented system calls have been fork() [...]
GopherCon 2017: A Go Programmer's Guide to Syscalls - Liz Rice
stack-based
Stack machines are arguably the simplest kind of computer architecture. Their LIFO structure is quite suitable for block-oriented languages. The code size for a stack machine can be very compact because most instructions have no operand field.