# \[ANN\] DispatcherCache.jl hash-graph adaptive persistency for task graphs

**URL:** <https://discourse.julialang.org/t/ann-dispatchercache-jl-hash-graph-adaptive-persistency-for-task-graphs/20944>\
**Category:** Package Announcements\
**Created:** [February 18, 2019, 5:07pm UTC](https://discourse.julialang.org/t/ann-dispatchercache-jl-hash-graph-adaptive-persistency-for-task-graphs/20944 "2019-02-18T17:07:54Z")\
**Posts on this page:** 1\
**Page:** 1

<div class="post-metadata">

**Author:** ![zgornel](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/zgornel/32/217487_2.png) [@zgornel](https://discourse.julialang.org/u/zgornel)\
**Post date:** [February 18, 2019, 5:07pm UTC](https://discourse.julialang.org/t/ann-dispatchercache-jl-hash-graph-adaptive-persistency-for-task-graphs/20944/1 "2019-02-18T17:07:54Z")

</div>

[DispatcherCache.jl](https://github.com/zgornel/DispatcherCache.jl) Adaptive hash-graph based persistency mechanism for [Dispatcher.jl](https://github.com/invenia/Dispatcher.jl) computational graphs.

The basic principle is to speed up the execution of task graphs by re-executing the minimal number of nodes possible (i.e. those which have arguments, code or dependencies changed).

The package still has a few rough edges and lacks extensive documentation however the API is simple and stable enough.