G. Koren, and D. Shasha, "D over :An optimal online scheduling algorithm for overloaded real-time systems", IEEE Real-time Systems Symposium, 290--299, 1992.  Home/Search   Document Not in Database   Summary   Related Articles

....with bounded competitive ratios on all inputs that are not closely correlated with processor speed. 1 Introduction We consider several well known nonclairvoyant scheduling problems, including the problem of minimizing the average response time [13, 15] and besteffort firm real time scheduling [1, 2, 3, 4, 8, 11, 12, 18]. We postpone formally defining these problems until the next section. In nonclairvoyant scheduling some relevant information, e.g. when jobs will arrive in the future, is not available to the scheduling algorithm A. The standard way to measure the adverse effect of this lack of knowledge is ....

....Since this is a maximization problem, the competitive ratio definitions in the introduction have to be modified by inverting the ratios. So for example, the competitive ratio for this problem is then min A max I Opt(I) A(I) The deterministic competitive ratio for this problem is Theta( Phi) [3, 4, 11, 18], and the randomized competitive ratio is Theta(min(log Phi; log Delta) 8, 12] where the importance ratio Phi is the ratio of the maximum value density of a job to the minimum value density of a job, and Delta is the ratio of the length of the longest job to the length of the shortest ....

G. Koren, and D. Shasha, "D over :An optimal online scheduling algorithm for overloaded real-time systems", IEEE Real-time Systems Symposium, 290--299, 1992.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC