Ada Tasking: From semantics to Efficient Implementation
- 1 March 1985
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Software
- Vol. 2 (2) , 34-46
- https://doi.org/10.1109/ms.1985.230349
Abstract
Tasking is one of the strengths of Ada, and, contrary to some opinion, can be implemented for a single shared processor by simple, straightforward, and efficient algorithms.Keywords
This publication has 7 references indexed in Scilit:
- Implementation strategies for Ada tasking idiomsPublished by Association for Computing Machinery (ACM) ,1982
- A formal model of distributed Ada taskingPublished by Association for Computing Machinery (ACM) ,1982
- Comparative efficiency of different implementations of the Ada rendezvousPublished by Association for Computing Machinery (ACM) ,1982
- Task state transitions in AdaACM SIGAda Ada Letters, 1981
- A multi-processing implementation-oriented formal definition of Ada in SEMANOLPublished by Association for Computing Machinery (ACM) ,1980
- Algorithms for translating Ada multitaskingPublished by Association for Computing Machinery (ACM) ,1980
- On a formal model of the tasking concept in AdaPublished by Association for Computing Machinery (ACM) ,1980