# Original proof that orders eliminate deadlocks?

A well-known approach to eliminate the possibility of a deadlock when accessing exclusive ressources is enforcing a partial (or total) order in which the ressources may be requested.

Which publication initially introduced this method?

• Wikipedia claims that Dijkstra used this method in his solution of the dining philosophers problem, the algorithm in his "hirarchical ordering of sequential processes" paper from 1971, however, seems quite different from that. Also, neither Wikipedia nor the paper claim tat Dijkstra introduced that method.
– dst
Sep 17, 2015 at 21:08