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

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… (More)
DOI: 10.1134/S0361768814010034

2 Figures and Tables

Topics

  • Presentations referencing similar topics