Ivan Sutherland elaborates on the idea of a “prison” defined by sequential computers that work with sequential character strings making communication expensive and obstructing concurrency.
Dierk König introduces GPars, Groovy’s library for concurrent programming, explaining a simpler and less error-prone way to use fork/join, map/reduce, actors, and dataflow in Java and Groovy.
Josh Suereth presents the new features available in Akka 2.0: clustered actors, including stateless and stateful ones, replication and the Cluster API.
Bob Ippolito explains how to solve concurrent update conflicts with Statebox, an open source library for automatic conflict resolution, running on top of Riak.
Dave Farley and Martin Thompson discuss solutions for doing low-latency high throughput transactions based on the Disruptor concurrency pattern.
Dale Schumacher presents several patterns of actor interaction that can be used in collaborative programs written in any language.
Charles Fry presents MapMaker, an in-memory caching solution on the JVM, discussing its API and implementation evolution along with internal details.
Cyprien Noel discusses distributed transactional memories along with ObjectFabric, a Java server based on eXtensible Software Transactional Memory, an OS library for concurrent and distributed apps.
Jonas Bonér introduces Akka, a JVM platform that wants to address the complex problems of concurrency, scalability and fault tolerance using Actors, STM and self-healing from crashes.
Jamie Ridgway explains what actors are, why we need them, what they are helpful for, the languages built around this programming paradigm, along with some demos showing actor-based apps.
Ulf Wiger advocates for a programming model change based on the actor model which more accurately reflects old human concurrency patterns that we have used in our daily lives for thousands of years.
Stuart Halloway discusses how we use a total control time model, proposing a different one that represents the world more accurately helping to solve some of the concurrency and parallelism problems.