2 citations · 3 across the 4 of their papers we have counts for
4 papers
Oobleck: Low-Compromise Design for Fault Tolerant Accelerators
Guy Wilks, Brian Li, Jonathan Balkind
Data center hardware refresh cycles are lengthening. However, increasing processor complexity is raising the potential for faults. To achieve longevity in the face of increasingly…
Using SBPF to Accelerate Kernel Memory Access From Userspace
Boming Kong, Zhizhou Zhang, Jonathan Balkind
The cost of communication between the operating system kernel and user applications has long blocked improvements in software performance. Traditionally, operating systems encourag…
Scaling Program Synthesis Based Technology Mapping with Equality Saturation
Gus Henry Smith, Colin Knizek, Daniel Petrisko +5
State-of-the-art hardware compilers for FPGAs often fail to find efficient mappings of high-level designs to low-level primitives, especially complex programmable primitives like d…
There and Back Again: A Netlist's Tale with Much Egraphin'
Gus Henry Smith, Zachary D. Sisco, Thanawat Techaumnuaiwit +6
EDA toolchains are notoriously unpredictable, incomplete, and error-prone; the generally-accepted remedy has been to re-imagine EDA tasks as compilation problems. However, any comp…