English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Optimizing a stateful dataflow language is a challenging task. There arestrict correctness constraints for preserving properties expected by downstreamconsumers, a large space of possible optimizations, and complex analyses thatmust reason about the behavior of the program over time. Classic compilertechniques with specialized optimization passes yield unpredictable performanceand have complex correctness proofs. But with e-graphs, we can dramaticallysimplify the process of building a correct optimizer while yielding moreconsistent results! In this short paper, we discuss our early work usinge-graphs to develop an optimizer for a the Hydroflow dataflow language. Ourprototype demonstrates that composing simple, easy-to-prove rewrite rules issufficient to match techniques in hand-optimized systems.

Optimizing Stateful Dataflow with Local Rewrites