The simplest?
Jonas Agerberg · ACM SIGAda Ada Letters · 1985
The problem with the dining philosophers is one of the pet models for illustration of the various problems (deadlock, starvation etc) that may occur when concurrent tasks have conflicting interests.Various solutions have been presented in textbooks on Ada, most of them correct but usually more clumsy than necessary. The solution presented here is based upon one single and simple strategy which leads to a clean and simple program structure.