Skip to content

Exercises for Concurrency Theory, including dining philosophers, thread scheduling with trace theory, graph grammar modeling, and concurrent linear algebra algorithms.

Notifications You must be signed in to change notification settings

strzebon/concurrency

Repository files navigation

Concurrency Theory

This repository contains exercises for the Concurrency Theory course, focusing on practical implementations and analysis of concurrent systems.

Exercises

  1. Dining Philosophers Problem
    Compare different solutions and implementations of the classic five philosophers problem.

  2. Trace Theory & Graph Grammars

    • Use trace theory for thread scheduling.
    • Represent concurrent threads using graph grammars, where production execution models thread execution.
    • Example: transaction sequences modifying variables.
  3. Concurrent Linear Algebra Algorithms

    • Apply trace theory for thread scheduling in classical linear algebra algorithms.
    • Example: concurrent Gaussian elimination.

About

Exercises for Concurrency Theory, including dining philosophers, thread scheduling with trace theory, graph grammar modeling, and concurrent linear algebra algorithms.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published