Eventual Consistency: Actors and Data Structures

Related lectures (27)

Page 1 of 3

Covers optimal purely functional priority queues, Scala implementation, Stainless integration, operations properties, and binomial queues.

Covers the representation of mathematical models, functions, and data structures in information systems.

Covers the implementation of Conc-Trees in Scala for parallel programming.

Explains two-phase construction for arrays, hash tables, and search trees in parallel.

Covers Python list manipulation and comprehension, emphasizing memory representation and mutability.

Explores lazy evaluation and lazy lists in Scala, emphasizing their benefits and implementation.

Explores the verification of programs using Stainless, focusing on functional correctness, proof assistants, and automation of reasoning tasks.

Explores tuples, sets, and dictionaries in Python, covering immutability, uniqueness, and key-value pairs.

Introduces RDMA and Persistent Memory, discussing their features, challenges, and impact on concurrent algorithms.

Covers list construction, methods, and implementations, including exercises and complexity analysis.