* Learn about the key distributed algorithms that can be used to solve common problems when architecting distributed systems, * Discover how these algorithms can be efficiently implemented in DDS, * Learn how the algorithms can be used to build higher level abstractions such as distributed queues, atomic distributed caches, etc.
The Object Management Group’s (OMG) Data Distribution Service for Real-Time Systems (DDS) standard has witnessed strong adoption as the distribution middleware of choice for a large class of mission and business critical systems, such as Air Traffic Control, Automated Trading, SCADA, Smart Energy, etc.
The main reason for choosing DDS lies in its efficiency, scalability, high-availability and configurability - through its 20+ Quality of Service (QoS) policies. Yet, all of these desirable properties come at the cost of a relaxed consistency model with no strong guarantees over global invariants.
As a result, many architects have to devise, by themselves – assuming the DDS primitives as a foundation – the correct algorithms for classical problems such as fault-detection, leader election, consensus, distributed mutual exclusion, atomic multicast, distributed queues, etc.
In this Webcast we will explore DDS-based distributed algorithms for many classical, yet fundamental, problems in distributed systems. For simplicity, we will start with algorithms that ignore the presence of failures. Then we will (1) demonstrate how these algorithms can be extended to deal with failures, and (2) introduce Paxos as one of the fundamental algorithms for consensus and atomic broadcast. Finally, we will show how these classical algorithms can be used to implement useful extensions of the DDS semantics, such as multi-writer / multi-reader distributed queues.
The webcast will be presented by industry leading expert Angelo Corsaro, Ph.D., OpenSplice DDS CTO and co-chair of the OMG DDS Special Interest Group.