Matthias Broecheler discusses graph computing, introducing the Aurelius graph cluster enabling graph computing at scale by building on distributed systems like Cassandra, HBase, and Hadoop.
Rusty Sears introduces REEF along with examples of computational frameworks, including interactive sessions, iterative graph processing, bulk synchronous computations, Hive queries, and MapReduce.
Bikas Saha and Arun Murthy detail the design of Tez, highlighting some of its features and sharing some of the initial results obtained by Hive on Tez.
Ben Johnson discusses the Raft protocol and how it works. Raft is a consensus distributed protocol.
Steve Pember discusses creating Grails applications integrating message broker technologies, especially RabbitMQ, and applying SOA principles.
Sebastian Kanthak details how Spanner relies on GPS and atomic clocks to provide two of its innovative features: Lock-free strong reads and global snapshots consistent with external events.
Avi Bryant discusses how the laws of group theory provide a useful codification of the practical lessons of building efficient distributed and real-time aggregation systems.
Kyle Kingsbury discusses some of the limitations found in distributed systems and the way some of them behave under partitioning.
Jeff Magnusson details some of Netflix' key services: Franklin, Sting and Lipstick.
Joshua Suereth designs a scalable distributed search service with Akka and Scala using actors, and covering practical aspects of how to scale out with Akka’s clustering API.
Oleg Zhurakousky discusses architectural tradeoffs and alternative implementations of real-time high speed data ingest into Hadoop.
Andy Gross discusses the challenges introduced by distributed systems and the need for developing new skills and tools for dealing with them.