Andrew Gerrand introduces Go, demoing some of its main features through examples: a concurrent echo server, chat, channels, error handling, etc.
Mohammad Rezaei discusses fine-grained parallelism along with an algorithm called Aggregation and a concurrent map built to help dealing with it.
Andrew Sheppard overviews the driving forces behind GPU’s adoption by the financial industry, and explains the use of the Monte Carlo technique on GPUs.
Blake Matheny discusses the current status of Tumblr, its evolution and lessons learned along the way, 3 types of concurrency -Macro, Mecro and Micro-, and Motherboy –a dashboard system-.
Justin Sheehy discusses designing reliable distributed systems that can scale in order to deal with concurrency problems and the tradeoffs required by such systems.
G. Blake Meike discusses concurrency in Android, focusing on AsyncTask – what can be done with it, what problems using it and how to circumvent them.
Phil Trelford suggests domains, such as modeling, DSLs, concurrency, for which functional programming is well-suited, and areas for which an OO or a mixed approach has better results.
Damien Katz explains the benefits and drawbacks of using Erlang, why this language is from the future and why Couchbase has migrated some of the CouchDB’s initial Erlang code to C/C++.
Steve Vinoski introduces Erlang’s OTP Frmework, outlining some of its main features, including several behaviors – implementations of common patterns useful for concurrent fault-tolerant applications.
Bryan Hunter introduces Erlang, comparing various language features with C#’s, emphasizing what it is good for and doing a demo.
Peter Van Roy discusses solving concurrency issues with deterministic concurrency using Ozma, an extension of the Scala language employing the Oz deterministic dataflow concepts.
Trisha Gee introduces Disruptor, a concurrency framework based on a data structure – a ring buffer – that enables fast message passing in a parallel environment.