Notes concerning “Performance”

• Principled APL redux 02021-01-03 (updated 02021-12-31) (12 minutes)
• Relayout with heaps 02021-01-10 (updated 02021-01-15) (6 minutes)
• Trie PEGs 02021-01-15 (4 minutes)
• Can transactions solve the N+1 performance problem on web pages? 02021-01-16 (8 minutes)
• Compiling machine-code loops to pipelined dataflow graphs 02021-01-23 (updated 02021-01-27) (2 minutes)
• Trying and failing to design an efficient index for folksonomy data based on BDDs 02021-01-26 (updated 02021-01-27) (7 minutes)
• How do you fit a high-level language into a microcontroller? Let’s look at BBN Lisp 02021-02-23 (updated 02021-08-18) (76 minutes)
• Variable length unaligned bytecode 02021-03-02 (updated 02021-03-03) (4 minutes)
• A survey of imperative programming operations’ prevalence 02021-03-02 (updated 02021-09-11) (61 minutes)
• Garbage-collected allocation performance on current computers 02021-03-13 (updated 02021-04-08) (4 minutes)
• Some notes on reading Chris Seaton’s TruffleRuby dissertation 02021-03-21 (updated 02021-03-22) (16 minutes)
• Open coded primitives 02021-03-22 (26 minutes)
• Minor improvements to pattern matching 02021-03-24 (updated 02021-04-08) (10 minutes)
• Faygoo: a yantra-smashing ersatz version of Piumarta and Warth’s COLA 02021-07-14 (updated 02021-12-30) (17 minutes)
• Ropes with constant-time concatenation and equality comparisons with monoidal hash consing 02021-07-27 (15 minutes)
• Compilation of block arguments to high-performance code 02021-07-29 (updated 02021-12-30) (19 minutes)
• A compact bytecode sketch that should average about 3 bytes per line of C 02021-08-17 (updated 02021-09-13) (66 minutes)
• Lazy heapsort 02021-08-22 (updated 02021-09-11) (6 minutes)
• Qfitzah: a minimal term-rewriting language 02021-09-10 (updated 02021-12-31) (62 minutes)
• Fung’s “I can’t believe it can sort” algorithm and others 02021-10-05 (updated 02021-12-30) (5 minutes)
• Pipelined piece chain painting 02021-10-10 (updated 02021-12-30) (23 minutes)
• Hashing text with recursive shingling to find duplication efficiently 02021-10-30 (updated 02021-12-30) (6 minutes)