Executable Code Golf - Making Tiny Binaries for Constrained Systems

Executable Code Golf - Making Tiny Binaries for Constrained Systems

linux.conf.au via YouTube Direct link

Intro

1 of 23

1 of 23

Intro

Class Central Classrooms beta

YouTube playlists curated by Class Central.

Classroom Contents

Executable Code Golf - Making Tiny Binaries for Constrained Systems

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Intro
  2. 2 What is Code Golf?
  3. 3 But What is Executable Code Golf?
  4. 4 Example: Paint in 16 bytes
  5. 5 My Hobby: Making 256B Animations
  6. 6 Many Different Categories
  7. 7 State of the Art 1kB to 8kB (Windows v. Linux)
  8. 8 XLINK project (1) • Goal: Produce an open source link-time compressor non-Windows platforms
  9. 9 PAQ Compression Algorithm
  10. 10 Arithmetic Range Coding Properties
  11. 11 Context Modeling and Context Mixing
  12. 12 Sparse n-gram Context Modeling . For each bit to decode
  13. 13 Complete Decoder Specification • Entropy Segment data structure that describes decoder problem
  14. 14 Why does this work better than LZ based compression?
  15. 15 Anatomy of an Object / Library File
  16. 16 XLINK Implementation • Linux linker has many implementation concerns
  17. 17 Programming in MS-DOS
  18. 18 Cannot access enough memory for hash table
  19. 19 Need 32-bit registers for more accurate EC
  20. 20 Hash function too slow for use on 386
  21. 21 i386 PAQ Decompression Stub (255 bytes)
  22. 22 Why should I care about binary compression in 2019?
  23. 23 Future Directions

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.