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

In this short paper, we explore a new way to refactor a simple buttricky-to-parallelize tree-traversal algorithm to harness multicoreparallelism. Crucially, the refactoring draws from some classic techniques fromprogramming-languages research, such as the continuation-passing-styletransform and defunctionalization. The algorithm we consider faces aparticularly acute granularity-control challenge, owing to the wide range ofinputs it has to deal with. Our solution achieves efficiency from heartbeatscheduling, a recent approach to automatic granularity control. We present oursolution in a series of individually simple refactoring steps, starting from ahigh-level, recursive specification of the algorithm. As such, our approach mayprove useful as a teaching tool, and perhaps be used for one-offparallelizations, as the technique requires no special compiler support.

The best multicore-parallelization refactoring you've never heard of