Concurrent Programming: Theory to Practice

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (29)

Page 3 of 3

Minimum Spanning Trees: Prim's Algorithm

Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.

Properties of X/G

Explores the properties of the quotient space X/G when X is compact and sometimes separated.

Efficient Graph Queries: Memory Constraints

Explores scaling pattern matching in large graphs and optimizing query execution under memory constraints using work-sharing and batch processing.

Functions and Integers

Covers functions, integers, GCD, and reasoning by recurrence, including the Euclidean algorithm and induction principle.

Advanced Analysis II: Tangent Plan and Differentiability

Explores tangent planes and differentiability in advanced analysis, emphasizing the properties of tangent planes and the conditions for differentiability.

Cache Coherence: Basics and Protocols

Explores cache coherence challenges, protocols, and directory-based solutions in multi-core systems.

Derivative: Application Examples

Explores examples of using derivatives to find tangent lines and points on graphs.

Connectivity in Graph Theory

Covers the fundamentals of connectivity in graph theory, including paths, cycles, and spanning trees.

Caches - Performance

Explores cache memory performance evaluation, covering benchmarks, Amdahl's law, CPU performance, memory hierarchy, cache optimizations, and multilevel caches.