A. Burns
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.
- Burns, A., Concurrent Programming in Ada, Cambridge University Press - Ada Companion Series, to be published, 1985. Google Scholar
Digital Library
- Enslow, P. and Saponas, T., Distributed and Decentralised Control in Fully Distributed processing Models, GIT-ICS-81/02, Georgia Institute of Technology, 1981.Google Scholar
- Yemini, S., On the Suitability of Ada Multitasking for Expressing Parallel Algorithms, Proceedings of the AdaTec Conference on Ada, pp91--97, 1982.Google Scholar
- Nissen, J. and Wallis, P. (editors), Portablity and Style in Ada, Cambridge University Press - Ada Companion Series, 1984. Google ScholarDigital Library
- Wellings, A., Distributed Operating Systems and the Ada Programming Language, D. Phil. Thesis, University of York, UK, 1984.Google Scholar
- Kung, H. T., Why Systolic Architectures, IEEE Comput., pp 37--46, 1982.Google Scholar
Recommendations
An Efficient Dynamic Scheduling Algorithm for Multiprocessor Real-Time Systems
Many time-critical applications require predictable performance and tasks in these applications have deadlines to be met. In this paper, we propose an efficient algorithm for nonpreemptive scheduling of dynamically arriving real-time tasks (aperiodic ...
Energy-efficient scheduling algorithm for real-time tasks with multiple parallel segments in multiprocessor systems
RACS '19: Proceedings of the Conference on Research in Adaptive and Convergent SystemsSome applications with real-time requirements needing a lot of computing power executes in a multiprocessor system. If such an application only uses the computing power from one processor, it may not be completed within its deadline. Therefore, the ...
Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems
Efficient scheduling algorithms based on heuristic functions are developed for scheduling a set of tasks on a multiprocessor system. The tasks are characterized by worst-case computation times, deadlines, and resources requirements. Starting with an ...
Comments