Main Content

Fewer Constraints, More Concurrency

About the Talk

June 18, 2011 9:30 AM

Gothenburg, Sweden

Gothenburg, Sweden

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.

Ratings and Recommendations

Avg. Rating

Average based
on 25 ratings

comments powered by Disqus