Distributed Patterns in Action

Eric Redmond (Basho)
Cloud
Location: F150
Average rating: ****.
(4.43, 14 ratings)
Slides:   1-PDF 

I plan to begin with a set of distributed data structures. We’ll investigate how and why each type work, and more importantly, what exactly you use them for.

  • Merkle trees: Active anti-entropy for replicated values
  • hash rings: Value distribution between servers
  • vector clock: Track the descendant of object states across systems, where timestamps are unreliable
  • bloom filters: Reduce cache reads by pre-checking existence
  • CRDTs (commutative replicated data types): Automated replicated value merging on any eventually consistent database: counters, sets, maps.
  • messaging patterns: Passing signals between processes and/or data storage (data structures): request-reply, publish-subscribe, push-pull, exclusive pair
Photo of Eric Redmond

Eric Redmond

Basho

Eric’s a programmer. He’s also a longtime advocate of alternative storage mechanisms (especially the distributed kind), and loves to write and talk about them. He’s co-author of Seven Databases in Seven Weeks and recently A Little Riak Book. Eric is a Riak Engineer at Basho, small-scal conference organizer, and runs the largest technical web group in Portland.

Sponsors

Sponsorship Opportunities

For information on exhibition and sponsorship opportunities at the conference, contact Sharon Cordesse at (707) 827-7065 or scordesse@oreilly.com.

Contact Us

View a complete list of OSCON contacts