Differences

This shows you the differences between two versions of the page.

--- newsletters:2024-03 [2024/04/02 02:32] – [Live USB & distribution] osnr
+++ newsletters:2024-03 [2024/04/02 02:48] (current) – Add Forrest youtube links & embeds admin
@@ Line 21: / Line 21: @@
     * {{youtube>Z_bMrp_-G6I?}}
-  * [[https://www.forresto.com|Forrest O.]] has been doing a lot of experiments with his hexagon tiles, making mini-games, rainbow outlining and animation, loop puzzles TODO
+  * [[https://www.forresto.com|Forrest O.]] has been doing a lot of experiments with his [[https://www.youtube.com/watch?v=2mRqCtfaogY|hexagon tiles]], making [[https://www.youtube.com/watch?v=lHjmi4cxUC4|mini-games]], [[https://www.youtube.com/watch?v=H3AHmIHRWPs|rainbow outlining]] and [[https://www.youtube.com/watch?v=ngB2AQdHdTM|animation]], and [[https://www.youtube.com/shorts/F4xEztsgJYQ|loop puzzles]]
+    * {{youtube>ngB2AQdHdTM?}}
+    * {{youtube>lHjmi4cxUC4?}}
   * [[https://cristobal.space|Cristóbal Sciutto]] mirrored his [[notes:tableshots|"Towards a folk computer"]] piece about tableshots [[https://cristobal.space/writing/folk-computer.html|up on his site]]
@@ Line 49: / Line 51: @@
 Nice side benefit of the new evaluator: it boots much faster, making it faster to iterate and test things, because it's only compiling virtual-program-level C code (Gpu, AprilTags); the kernel is statically compiled into a monolithic folk binary. (this feels like a reasonable tradeoff, since no one was messing with the kernel in practice anyway)
+Some remaining stuff to do:
+  * Performance optimization so we can get it to beat old evaluator, which is the whole point
+  * Implement Collect & text/labels (the major missing functionality in new evaluator)
+  * Fix memory leaks (it might end up better than old evaluator here too, since that is leaky anyway)
+  * Thread management so we can spin up new worker threads as needed to run Whens when current workers are asleep/blocked/unresponsive
+There are still some high-level challenges from parallelizing the workqueue, stuff that we 'got for free' from having a single thread and converging to a fixed point. like, what order do you do operations in, how do you avoid wasted work, what does 'order' mean if things can happen in parallel.. I think we can hack around a lot of this by messing with priorities and specifying manual 'wait a few milliseconds' type stuff for specific Whens, or maybe having some notion of local convergence or subconvergence.
 ==== Live USB & distribution ====