Mastodon Feed
jonny@neuromatch.social ("jonny (nonvenomous)") wrote:
so our graph processing lib has something like 30 microseconds of overhead per call, about a quarter of that can be trivially trimmed, and another quarter can be written out. and that's without using any of the yno graph parts whose whole purpose is to make it easy to run graphs of operations p close to optimally concurrent. So its looking sorta sweet I think