摘要
We consider the problem of competitive on-liae scheduling in two processor real-timesystems. In our model all tasks have common value density. Each task has a release time. an exe-cution time and a deadline. The scheduler is given no information about a task until it is released.And the value will be achieved if and only if the task is completed by its deadlirte. Moreover. wesuppose that migratbn is not allowed. The goal of the scheduler is to obtain as much value as pos-sible. In this paper we show that the competitive multipber of Safe-Risky-fixed Algorithm irt [4]is really 3 and presents a modified algorithm (Safe-Risky-unfixed Algorithm) that achieves a com-petitive mukiplier of 2. 79.
