Introducing Wrek; A Library For Executing Dependency Graphs

Dependency graphs are a useful representation for exploring opportunities to introduce concurrency in a larger system. They are hidden all over computing (compilers, build systems) and everyday life (to-do lists, cooking recipes). Users can define a set of tasks, as well as dependencies between them, and wrek will execute the resulting graph as concurrently as possible.

OBJECTIVES

Introduce/refamiliarize the audience with dependency graphs, explore the conception and design of wrek, showcase how wrek can be used and integrated into larger projects, demonstrate wrek's broad applicability.

AUDIENCE

Developers interested in seeing where mathematics and everyday life collide. Developers interested in new Erlang/OTP libraries.