Characterizing global work-conserving scheduling tardiness with uniform instances on multiprocessors

HIGHLIGHTS

• What: The authors approach the problem of bounding tardiness for the class of work-conserving non-preemptive global schedulers from below: the authors restrict the study to a particular class of task sets, and the authors provide an exact analytical tardiness description of all the considered instances. The authors provide the hyper-parameter length and the exact maximum tardiness value of any instance, both computable in time linear in the minimum number of processors and the job length. In the literature of soft real-time scheduling, significant research has been conducted on establishing tardiness bounds, and a . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or Email

  Password

  Remember me

  Lost your password?

  If you don't have an account, you can create one here.