PP Presentation

The graph is constructed in such away that if all packets move from buffer to buffer along the arcs of the graph, then no deadlocks can occur.
Blazewicz et al.(1987a).In their algorithm each packet bears a globally unique time stamp.