Rain Leander

This talk uses the world of ballet to explain the complex field of distributed computing in a fun and accessible way. The talk explores how concepts of ensemble, pas de deux, choreography, grand jeté, adagio, and tutu can be used to explain different aspects of distributed computing. The speaker draws parallels between the precision and coordination required of ballet dancers and the precision and coordination required of devices working together in distributed computing. By using relatable and engaging metaphors, the speaker breaks down complex computing concepts and makes them more accessible to a broader audience.

Why did the choreographer refuse to use orchestration in their distributed system? Because they wanted their components to dance to their own beat, without a central conductor! This talk explores the differences between choreography and orchestration in software development for distributed systems. Choreography involves the independent coordination of software components through message passing, while orchestration involves a central orchestrator managing the interactions between components. Through examples such as e-commerce and travel booking systems, the strengths and weaknesses of each approach are highlighted. By understanding the pros and cons of each approach, software developers can make informed decisions about which approach to use for their specific use case, ultimately finding harmony in their distributed systems.

This talk explores the differences between deterministic and non-deterministic algorithms in software engineering using Shakespearean references. By drawing on quotes from Shakespeare's plays and sonnets, the talk offers a unique and engaging perspective on the decision software engineers must make when choosing between these algorithmic approaches. The talk covers the definitions of deterministic and non-deterministic algorithms, provides examples of each type, and discusses their respective advantages and disadvantages. By the end of the talk, attendees will gain a better understanding of the use cases for each type of algorithm and be able to apply this knowledge to their own software development projects.