Some algorithms for analysis and synthesis of real-time multiprocessor computing systems

Authors:
M. G. Furugyan
Affiliations:
Faculty of Computational Mathematics and Cybernetics, Moscow State University, Moscow, Russia 119991
Venue:
Programming and Computing Software
Year:
2014

Citing 6
Cited 0

Preemptive scheduling of uniform machines by ordinary network flow techniques

Management Science
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Preemptive Scheduling of Uniform Processor Systems

Journal of the ACM (JACM)
Preemptive Scheduling with Release Times, Deadlines, and Due Times

Journal of the ACM (JACM)
Introduction to algorithms

Introduction to algorithms
Scheduling Algorithms

Scheduling Algorithms

Quantified Score

Hi-index	0.00

Visualization

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.