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

Many graph problems can be solved using ordered parallel graph algorithmsthat achieve significant speedup over their unordered counterparts by reducingredundant work. This paper introduces a new priority-based extension toGraphIt, a domain-specific language for writing graph applications, to simplifywriting high-performance parallel ordered graph algorithms. The extensionenables vertices to be processed in a dynamic order while hiding low-levelimplementation details from the user. We extend the compiler with new programanalyses, transformations, and code generation to produce fast implementationsof ordered parallel graph algorithms. We also introduce bucket fusion, a newperformance optimization that fuses together different rounds of orderedalgorithms to reduce synchronization overhead, resulting in$1.2\times$--3$\times$ speedup over the fastest existing ordered algorithmimplementations on road networks with large diameters. With the extension,GraphIt achieves up to 3$\times$ speedup on six ordered graph algorithms overstate-of-the-art frameworks and hand-optimized implementations (Julienne,Galois, and GAPBS) that support ordered algorithms.

Optimizing Ordered Graph Algorithms with GraphIt