This paper studies multiprocessor scheduling for aperiodic tasks where future arrivals are unknown. We propose an algorithm for tasks without migration capabilities and prove that it has a capacity bound of 0.31. No algorithm for tasks without migration ...
Prior research on schedulability bounds focused primarily on bounding utilization/ as a means to meet deadline constraints. Nontrivial bounds were found for a handful of scheduling policies in which utilization is directly related to the ability of the ...
Current real-time systems such as robots have multiprocessors and the number of processors tends to be increased. In order to achieve these real-time systems, global real-time scheduling has been required. Many real-time scheduling algorithms are ...
IEEE Computer Society
United States
