1. Deadlock Detection in Distributed Process Networks – Alex Olson Process Networks (PN)  Determinate dataflow model [Kahn, 1974].  Concurrent processes communicate via one-way channels (queues).  Allows for dynamic I/O behavior (e.g. data-dependent)  Suitable for distributed implementations.

2. Deadlock Detection in Distributed Process Networks – Alex Olson PN Scheduling  Bounded scheduling may introduce artificial deadlock.  On detection of deadlock, enlarge smallest queue. [Parks,1995]  How can one detect deadlock in a distributed implementation?

3. Deadlock Detection in Distributed Process Networks – Alex Olson Mitchell-Merritt Algorithm [1984]  Developed for distributed databases.  “Single-Resource” algorithm.  Exactly one process detects local deadlock.  Highly suitable for non-distributed & distributed PN implementations.