Misc. resources:

- Message Dispatch on Modern Computer Architectures [Driesen, Hoelzle, Vitek]
- Separation Constraint Partitioning - A New Algorithm for Partitioning Non-strict Programs into Sequential Threads
- Active Messages Implementations for the Meiko CS-2

Intention mode locking:

- MYOAN: A Shared Virtual Memory for the Paragon XP/S
- 5.17 What is Intention Locking?
- 5.21 Summary of Intention Locking on a PUBLICROW Table
- 5.22 Summary of Intention Locking on a PUBLIC Table
- 5.23 How Do Table Types Affect Locking?
- 5.49 How Does KEEP CURSOR Affect Locking?
- Private Lock Management

Graph closure and parallelism, deadlock avoidance:

- Transitive closure
- Transitive Closure / Fixpoint Evaluation
- Discussion Of Parallel Algorithms
- Transitive Closure Computation
- Graph Problems -- polynomial-time algorithms
- THEORY RESULTS OF THE Kleisli PROJECT
- Weighted Graph Operations
- Models of the Pickup and Delivery Problem
- Tree Canonization and Transitive Closure
- Warshall's Algorithm
- Prof. Wen-Tsuen Chen's Publications
- Algebraic Structures for Transitive Closure
- Matrix Multiplication Algorithm: matmult.c
- Red Green Graph Model Extension
- Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching
- Efficient Transitive Closure Computation in Large Digraphs
- Transitive closure and reduction
- Fully Dynamic Transitive Closure in Plane Dags with One Source and One Sink
- Transitive closure

General Concurrency theory:

This list was kindly provided by Terry Lambert.