An idea is to provide a simple FS like experience with semantic paths and going beyond just local FS. It should use a multitude of pluggable stores but can start just with k-sharded sqlite (where k is 2*CPU coint) including inverted index there + fuzzy search library on top. It’s…

Given the pattern: const1.complex1.const2.complex2… that is a pattern that has at top level simple and complex pieces Instead match this: const1.*?const2.*?… That is ignoring content of complex sub-expressions. Then the validate step — run sub engines on each of the pieces requiring it to match the fulll exact slice. 2nd variation: complex1.const1… Here we handle the first one differently — match backwards from the start of const1.

Glossary DBP — delay-bandwidth product (~ RTT * throughtput) TCP tricks The DBP is important for TCP connections. This is because TCP is able to transmit a large number of packets into the network without having to wait for an acknowledgement for each one. Similarly, a TCP can receive a…

Make closures great for once” First — statically detect scopes of stack and allocate them as Context objects on heap or via allocator. Stick a ref-count in there if we must. Second — chain contexts with next pointer stored at the end of context object (if has parent, statically my…

My semantic-graph based software creation tool. (and analysis, code evolution & refactoring, build etc system) Code evolution — import of old code bases, de-duplication by linking to existing primitives, getting rid of hacks and scrapping language-native module system. Syntax-agnostic programming. Formatting-agnostic “files” (and diffs). Language-agnostic module system (external to any languages used).

Reserve huge mmap-ed arena. Reserve total machine memory + chunk size. Adjust starting address to be multiple of chunk size. Let chunk be 2mb huge page. Reserve pool table: TotalMem / 2Mb of uints, 0. — empty chunk, 1 — pool #0, etc. (2Tb heap requires 4mb reserve) Global state: …

Regional Non-generational With TLABs (thread-local caches) With semi-precise scanning Mostly copying and remapping — pinned objects are remapped at memory page granularity to a special remap region(s), with original page PROT_NONE-ed. Page fault handler patches any of the remaining pointers on access. The holes are restored after collection by revers of this operation (now remapped pages patch things back on access)

The idea is to package application as a minimal squashfs image. squash — a command line tool (simple, portable shell script) used to paxk, examine, sign/validate and repack such images. Relies on gpg for signatures, and other fs command-line tools for repacking. Then we carefully designe such image structure to…

My biggest issue with current offerings such as Kubernetes is value/complexity ratio. All of these pods, kubelets, groups, tons of error-prone configuration, dozens of daemons and yet it doesn’t solve any of the most basic things I care about: Transparent service discovery 2. Dynamic reconfiguration 3. Log aggregation 4. Basic…