8- https://doi.org/10.1134/s0361768814010034
Some algorithms for analysis and synthesis of real-time multiprocessor computing systems
- Jan 1, 2014
- Programming and Computer Software
- M G Furugyan
Abstract
The problem of preemptive scheduling in a real-time multiprocessor computing system with release time/deadline intervals is investigated. Approximate algorithms based on the generalization of a single-processor algorithm of relative priority are developed and compared to the exact maximum flow algorithm. An algorithm has been developed for the case where requests for the tasks occur periodically with given periods. An algorithm for determining the values of the processor performance for which there exists an admissible schedule for a given assembly of tasks with release time/deadline intervals has been developed.
- # Problem Of Preemptive Scheduling
- # Assembly Of Tasks
- # Real-time Computing
- # Algorithms For Analysis
- # Analysis Of Real-time Systems
- # Real-time Multiprocessor System
- # Analysis Of Computing Systems
- # Real-time Computing System
- # Exact Flow
- # Algorithms For Synthesis
