A study of tasking models in Concurrent C, SR, and Ada
D.M. Weldy, Sajjan G. Shiva · 2002
This paper examines how tasking is implemented in the languages Concurrent C, SR, and Ada. It describes how a solution was implemented for the dining philosophers problem in each of the three languages. Lastly, it compares how tasks are implemented and used in those languages, and the advantages and disadvantages of each.>