Title :
A study of tasking models in Concurrent C, SR, and Ada
Author :
Weldy, Dennis M. ; Shiva, Sajjan G.
Author_Institution :
Colsa Corp., Huntsville, AL, USA
Abstract :
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
Keywords :
Ada; C language; concurrency control; resource allocation; Ada; Concurrent C; SR; dining philosophers problem; tasking models; Computer science; Programming profession; Protocols; Resumes; Runtime environment; Strontium; Virtual machining; Welding;
Conference_Titel :
System Theory, 1994., Proceedings of the 26th Southeastern Symposium on
Conference_Location :
Athens, OH
Print_ISBN :
0-8186-5320-5
DOI :
10.1109/SSST.1994.287868
