Periodic scheduling in real-time multiprocessor automated control systems (Q1882036)

The author considers a real-time multiprocessor automated control systems. In particular, he considers a computer system consisting of \(M\) parallel processors of \(L\) types and the case when jobs preemption is admitted, demands for jobs arriving cyclically with predefined periods, and every job can be serviced by any processor. The paper follows former papers dealing with a similar, however specific, case of the above mentioned one. A aim of the paper is to deal with the problem of constructing an admissible schedule for the case of processors of different performance, jobs admitting interrupts. A corresponding polynomial algorithm is proposed. The paper is written in an understandable way.