Affiliation:
1. University of Bradford, Bradford, UK
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Reference6 articles.
1. Burns A. Concurrent Programming in Ada Cambridge University Press - Ada Companion Series to be published 1985. Burns A. Concurrent Programming in Ada Cambridge University Press - Ada Companion Series to be published 1985.
2. On the suitability of Ada multitasking for expressing parallel algorithms
3. Wellings A. Distributed Operating Systems and the Ada Programming Language D. Phil. Thesis University of York UK 1984. Wellings A. Distributed Operating Systems and the Ada Programming Language D. Phil. Thesis University of York UK 1984.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Ada in distributed systems;ACM SIGAda Ada Letters;1997-03
2. Implementing JSD designs in Ada: a tutorial;ACM SIGSOFT Software Engineering Notes;1990-07
3. Usability of the Ada tasking-model;ACM SIGAda Ada Letters;1990-03
4. Tasking troubles and tips;ACM SIGPLAN Notices;1988-08
5. Proposal for adding discriminants for Ada task types;ACM SIGAda Ada Letters;1987-09