Portability and style in ADA
Concurrent programming in Ada
Proposal for adding discriminants for Ada task types
ACM SIGAda Ada Letters
ACM SIGPLAN Notices
Usability of the Ada tasking-model
IRTAW '89 Proceedings of the third international workshop on Real-time Ada issues
Implementing JSD designs in Ada: a tutorial
ACM SIGSOFT Software Engineering Notes
Ada in distributed systems: an overview
ACM SIGAda Ada Letters
| Hi-index | 0.00 |
As an Ada task cannot be initialised at the time of creation a rendezvous must be used to pass identification data to those tasks that require it. With multiprocessor systems this initialisation phase can be a source of inefficiency as it is, essentially, a sequencial activity. Algorithms, and code, are presented that remove this potential bottleneck by involving all tasks in the initialisation process. Two approaches are discussed; the first delays each active task by a minimum amount (the time it takes to perform two rendezvous), the second method delays all active tasks but initialises the maximum number in any time period. For example 1023 tasks can be initialised in the time taken to perform 10 rendezvous.