No abstract

No abstract

No abstract

No abstract

No abstract

No abstract

Recent research in real-time divisible load theory (RT-DLT) has addressed the problem of distributing arbitrarily parallelizable real-time workloads among processors which become available at different instants in the future. Given a real-time job and the times as which the processors become available, we devise exact efficient algorithms to solve two important problems: (i) determine the smallest number of processors needed to complete this job by its deadline; and (ii) given a specific number of processors, determine the earliest completion time for the job on these processors.

Recent research in real-time divisible load theory (RT-DLT) has addressed the problem of distributing arbitrarily parallelizable real-time workloads among processors which become available at different instants. In prior work [1], we proposed a LinearProgramming based formulation of the problem of computing the completion time of a real-time workload on a given collection of processors. In this paper, we show via extensive experimental evaluation that this LP based formulation significantly improves on the heuristic approximations [8,9] that were the only techniques previously known for solving these problems.