Study of tasking models in Concurrent C, SR, and Ada


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.

Publication Title

Proceedings of the Annual Southeastern Symposium on System Theory

This document is currently not available here.