S. Baruah and J. Haritsa. On Improved Performance Guarantees Through the Use of Slack Times. Submitted for publication. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Speed is as Powerful as Clairvoyance - Kalyanasundaram, Pruhs (1995) (73 citations) (Correct)
....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 ....
....show that if a real time system is designed so that every job has laxity that is a reasonable fraction of the execution time of that job, then the resulting competitive ratio is reasonably small. The effect of laxity on the competitive ratio in the special case of Phi = 1 was considered in [1, 6]. We then show that the ffl weak competitive ratio for Slacker approaches one as ffl increases. The weak adversary model, comparing an online algorithm against a less powerful but more knowledgeable adversary, has been considered before in queryresponse problems such as the k server problem and ....
S. Baruah, and J. Haritsa, "On improved performance guarantees through the use of slack times," Tech. Report, Computer Science Dept., University of Vermont.
On-Line Scheduling to Maximize Task Completions - Baruah, Haritsa, Sharma (1994) (17 citations) Self-citation (Baruah Haritsa) (Correct)
....of the results presented here, and outline future research directions. For the sake of completeness, we include in Appendix A a proof that, in the general case, Earliest Deadline has an arbitrarily poor competitive factor with respect to both the EPU and CC metrics. This proof is reproduced from [9]. We have also proved that Earliest Deadline exhibits arbitrarily poor overload performance in all the special cases that are considered here this is necessary to demonstrate the need for developing new scheduling algorithms for these special cases. Due to space limitations, we have omitted ....
S. Baruah and J. Haritsa. On Improved Performance Guarantees Through the Use of Slack Times. Submitted for publication.
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