<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Rust on Matthew's Blog</title><link>https://blog.daubney.dev/tags/rust/</link><description>Recent content in Rust on Matthew's Blog</description><generator>Hugo</generator><language>en-gb</language><lastBuildDate>Tue, 25 Aug 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://blog.daubney.dev/tags/rust/index.xml" rel="self" type="application/rss+xml"/><item><title>Rust Based Workflow Runner - Part 1: Architecture</title><link>https://blog.daubney.dev/posts/rust_based_workflow_runner_1_architecture/</link><pubDate>Tue, 25 Aug 2026 00:00:00 +0000</pubDate><guid>https://blog.daubney.dev/posts/rust_based_workflow_runner_1_architecture/</guid><description>&lt;p&gt;At some point in my journey when learning any programming language, I hit a point&#10;where I decide to make a directed acyclic graph (DAG) based task runner.&lt;/p&gt;&#10;&lt;p&gt;Whether this is a good idea or not, whether I should just use one of:&lt;/p&gt;&#10;&lt;ul&gt;&#10;&lt;li&gt;&lt;a href="%5BOpenWhisk%5D(https://openwhisk.apache.org/)"&gt;OpenWhisk&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a href="https://docs.celeryq.dev/en/stable/getting-started/introduction.html"&gt;Celery&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a href="https://docs.gitea.com/usage/actions/"&gt;Gitea Actions&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a href="https://www.jenkins.io/"&gt;Jenkins&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a href="https://circleci.com/"&gt;CircleCI&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a href="https://www.rundeck.com/"&gt;RunDeck&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a href="https://airflow.apache.org/"&gt;Airflow&lt;/a&gt;&lt;/li&gt;&#10;&lt;/ul&gt;&#10;&lt;p&gt;Or one of countless other job runners is kind of irrelevant. I have Opinions&lt;sup&gt;TM&lt;/sup&gt;&lt;/p&gt;&#10;&lt;p&gt;Lets sketch out the basic architecture and we can cover those opinions as they come up.&lt;/p&gt;</description></item></channel></rss>