Uploaded May 2018 | Updated November 2026, 2 days ago
Most applications have background jobs that require managing. While a basic queue implementation is simple to write, it could riddle your system with tight coupling, and straddle the developers with multiple nearly-duplicate implementations.
In this talk, I will explain our design constraints for such a task queue system, and present an implementation, taking into account Elixir’s strengths in concurrency, state management, and node clustering. I will also examine the performance characteristics of such an implementation.
More details on the website: http://www.elixirconf.eu/elixirconfeu2018/evadne-wu
Most applications have background jobs that require managing. While a basic queue implementation is simple to write, it could riddle your system with tight coupling, and straddle the developers with multiple nearly-duplicate implementations.
In this talk, I will explain our design constraints for such a task queue system, and present an implementation, taking into account Elixir’s strengths in concurrency, state management, and node clustering. I will also examine the performance characteristics of such an implementation.
More details on the website: http://www.elixirconf.eu/elixirconfeu2018/evadne-wu



![The forgotten advantages of concurrency (Lets #TalkConcurrency - QU2)
Question 2 of Lets #TalkConcurrency - Is there anything forgotten which should be known, or anything which you feel has been overshadowed, which is important [in concurrency]?
Sir Tony Hoare, Joe Armstrong, Carl Hewitt and Francesco Cesarini discuss the positives of concurrency that can otherwise be forgotten...
Full transcript: The forgotten advantages of concurrency (Lets #TalkConcurrency - QU2)](https://i.ytimg.com/vi/uORIxJhOjkI/mqdefault.jpg)






