Author:
Locke C. Douglass,Mesler Thomas J.,Vogel David R.
Abstract
Ada 83 has often been criticized for its lack of a lightweight data synchronization primitive. Compiler vendors have responded to this criticism by implementing the Haberman-Nassi algorithm with a construct called a
passive
task. The Ada 9X Project has proposed a change to the Ada language adding a
protected record
construct to support lightweight synchronization. In this paper, we illustrate the changes in coding required to convert an application originally designed to exploit passive tasking to use the protected record construct instead. The resulting software engineering effects of using passive tasks and protected recordsre then compared for this sample task set. We conclude by discussing some protected recorded semantics that may require further clarification and/or modification, and some of the trade-offs that result.
Publisher
Association for Computing Machinery (ACM)
Reference12 articles.
1. [
1
] A. Nico Habermann and Issac R. Nassi Efficient Implementation of Ada Tasks Carnegie Mellon University Department of Computer Science CMU-CS-80-103 1980. [1] A. Nico Habermann and Issac R. Nassi Efficient Implementation of Ada Tasks Carnegie Mellon University Department of Computer Science CMU-CS-80-103 1980.
2. Improving Ada tasking performance
3. Asynchronous communication in Ada
4. Opening up Ada-tasking
5. Prioritized asynchronism in Ada 9X
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献