Fewer Constraints, More Concurrency.
Ryan Smith • Koto-ku, Tokyo, Japan • Talk

Date: June 01, 2013
Published: June 17, 2013
Announced: unknown

Traditional data structures like stacks and queues are strict - perhaps too strict. In this talk I will showcase some classical data structures and then provide alternative constraints that will allow our algorithms to achieve a greater level of concurrency. Examples will include a mix of Ruby and Postgres.

RubyKaigi 2013

Explore all talks recorded at RubyKaigi 2013
+55