osaid khan ozzyozbourne

Software Transactional Memory in C++: pure functional approach (Tutorial)

In this article I’ll tell you about my pure functional library for Software Transactional Memory (STM) that I’ve built in C++. I adopted some advanced functional programming concepts that make it composable and convenient to use. Its implementation is rather small and robust, which differentiates the library from competitors. Let’s discuss what STM is and how to use it.

Intro
Links
Software Transactional Memory
STM basics
Composable transactions
Dining Philosophers: The task

A simple overview of Zig's `std.log` for Zig v0.12.0 or higher

Logging functionality that supports:

If a log message should be printed is determined at comptime, meaning zero overhead for unprinted messages (so just leave the code peppered with debug logs, but when it makes sense scope them; so downstream users can filter them out)
Scoped log messages
Different log levels per scope
Overrideable log output (write to file, database, etc.)
All the standard std.fmt formatting magic

	Latency Comparison Numbers (~2012)
	----------------------------------
	L1 cache reference 0.5 ns
	Branch mispredict 5 ns
	L2 cache reference 7 ns 14x L1 cache
	Mutex lock/unlock 25 ns
	Main memory reference 100 ns 20x L2 cache, 200x L1 cache
	Compress 1K bytes with Zippy 3,000 ns 3 us
	Send 1K bytes over 1 Gbps network 10,000 ns 10 us
	Read 4K randomly from SSD* 150,000 ns 150 us ~1GB/sec SSD

	use std::{rc::Rc, cell::RefCell};
	#[derive(Debug)]
	struct TreeNode {
	val: i32,
	left: Option<Rc<RefCell<TreeNode>>>,
	right: Option<Rc<RefCell<TreeNode>>>
	}

	impl Drop for TreeNode { fn drop(&mut self) { println!(">>> Free Node {}", self.val); } }

	"""
	The most atomic way to train and run inference for a GPT in pure, dependency-free Python.
	This file is the complete algorithm.
	Everything else is just efficiency.

	@karpathy
	"""

	import os # os.path.exists
	import math # math.log, math.exp

	/*
	Minmal Cocoa Window with Metal API
	No error handling intentionally to just show the happy path

	IMPORTANT: you odin version needs to be using the commit edcd335 or later!
	Otherwise you will get a silent error at runtime as Cocoa would have not been linked!
	*/
	package minimal_metal_window

	import NS "vendor:darwin/Foundation"

	.global _main
	.align 2

	.data
	msg: .ascii "Hello, World!\n" ; non-null terminated 'string'
	len = . - msg ; Calculate string length (14 bytes)

	.text
	_main:
	mov x0, #1 ; File descriptor 1 = stdout

	apiVersion: v1
	kind: ConfigMap
	metadata:
	name: otel-collector-config
	data:
	config.yaml: \|
	receivers:
	otlp:
	protocols:
	http:

	/*
	* Parallel bitonic sort using CUDA.
	* Compile with
	* nvcc -arch=sm_11 bitonic_sort.cu
	* Based on http://www.tools-of-computing.com/tc/CS/Sorts/bitonic_sort.htm
	* License: BSD 3
	*/

	#include <stdlib.h>
	#include <stdio.h>

osaid khan ozzyozbourne

Software Transactional Memory in C++: pure functional approach (Tutorial)

A simple overview of Zig's std.log for Zig v0.12.0 or higher

Basic Usage:

A simple overview of Zig's `std.log` for Zig v0.12.0 or higher