Home - Topics - Papers - Theses - Blog - CV - Photos - Funny |
Interesting uses:
Side-channel leak control: PURBs
Indexing and counting for divide-and-conquer algorithms. Example: binary search (works) vs linear search (breaks quickly); quick/merge sorts (works) vs naive sorts (breaks); …
Related: summary data for large-scale data for parallel processing
Efficient memory allocation with fragmentation control Use next mag to bucket allocation units; allocation can scavenge and split a larger bucket and (proof?) remainder will also fall into a valid bucket (subtraction closure: mag minus a mag is a mag if no underflow)
Bryan Ford |