DocumentCode
1827749
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
fYear
1994
fDate
20-22 Mar 1994
Firstpage
281
Lastpage
284
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;
fLanguage
English
Publisher
ieee
Conference_Titel
System Theory, 1994., Proceedings of the 26th Southeastern Symposium on
Conference_Location
Athens, OH
ISSN
0094-2898
Print_ISBN
0-8186-5320-5
Type
conf
DOI
10.1109/SSST.1994.287868
Filename
287868
Link To Document