T. Matsumoto. Competitive analysis of the Round Robin algorithm. In Proc. 3rd International Symp. on Algorithms and Computation (ISAAC), volume 650 of Lecture Notes in Computer Science, pages 71--77. Springer, 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....time, for randomized algorithms in the case of no redundancy are exactly the same as for deterministic algorithms that use only redundancy. We know of no previous theoretical investigations of this kind into fault tolerant scheduling. Nonclairvoyant scheduling without faults is discussed in [2, 4, 5, 8]. In [5] it is shown that with dynamic release times and without faults, a nonclairvoyant deterministic (randomized) algorithm can not be better than Omega Gamma n 1=3 ) competitive( Omega Gamma075 n) competitive) with respect to average response time, even allowing preemptions. This shows ....

T. Matsumoto, "Competitive analysis of the round robin algorithm', International Symposium on Algorithms and Computation, 71 -- 77, 1992.

....where P is the ratio of the length of the longest job to the length of the shortest job. Note that the number of jobs used this lower bound construction is exponential in P . Run to completion is P competitive [12] The competitive ratio for the Round Robin algorithm is Omega Gamma n= log n) [11, 12]. Kalyanasundaram and Pruhs [7] show that the shortest elapsed time first algorithm, which always runs the job that has been run the least, is constant competitive if the online scheduler is equipped with a faster processor than the adversary. By combining the results in this paper with those in ....

T. Matsumoto, "Competitive analysis of the round robin algorithm', International Symposium on Algorithms and Computation, 71 -- 77, 1992.

....we show that there exist online algorithms 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 ....

....that any algorithm that doesn t unnecessarily idle the processors has a competitive ratio of O(n) Surprisingly, this is the best known upper bound on the competitive ratio, even allowing randomization. The competitive ratio for the commonly used Round Robin algorithm is Omega Gamma n= log n) [13, 15]. In section 3, we first consider the queue size as a function of time. Define QA (t; s) as the set of jobs that have been released before time t, but have not been finished by algorithm A by time t assuming that A is using a speed s processor. We show that for every nonclairvoyant scheduling ....

T. Matsumoto, "Competitive analysis of the round robin algorithm', International Symposium on Algorithms and Computation, 71 -- 77, 1992.

....completion time, for randomized algorithms in the case of no redundancy are exactly the same as for deterministic algorithms that use redundancy. We know of no previous theoretical investigations of this kind into fault tolerant scheduling. Nonclairvoyant scheduling without faults is discussed in [5, 7, 8, 10]. In [8] it is shown that with dynamic release times and without faults, a nonclairvoyant deterministic (randomized) algorithm can not be better than Omega Gamma n 1=3 ) competitive( Omega Gamma094 n) competitive) with respect to average completion time, even allowing preemptions. This shows ....

T. Matsumoto, "Competitive analysis of the round robin algorithm', International Symposium on Algorithms and Computation, 71 -- 77, 1992.

....where jobs can be interrupted and resumed from the point of interruption at little or no cost. The only other preemptive, non clairvoyant scheduling work to focus on the average waiting time of jobs rather than the makespan of the schedule is the concurrent and independent result of Matsumoto [65]. He studies the round robin algorithm and independently proves a lower bound on the performance of the round robin algorithm in the dynamic job setting that is identical to ours. Finally, there is a long history of results (predating Sleator and Tarjan s work) in the area of non omniscient ....

....the illusion that they have sole access to the system, and this is accomplished by minimizing the average waiting time of all jobs in the system. The only other non clairvoyant scheduling work to consider minimizing the average waiting time of jobs in the system is the concurrent work by Matsumoto [65] where he independently proves a lower bound on the performance of the CHAPTER 3. CPU SCHEDULING 41 round robin algorithm in the dynamic job setting that is identical to our Theorem 3.5.1. 3.1.1 The Model and Preliminaries We first define a generic scheduling problem; refer to the survey ....

T. Matsumoto. Competitive analysis of the round robin algorithm. In Proc. 3rd International Symposium in Algorithms and Computation, pages 71--77, 1992.

No context found.

T. Matsumoto. Competitive analysis of the Round Robin algorithm. In Proc. 3rd International Symp. on Algorithms and Computation (ISAAC), volume 650 of Lecture Notes in Computer Science, pages 71--77. Springer, 1992.

No context found.

T. Matsumoto, "Competitive analysis of the round robin algorithm', International Symposium on Algorithms and Computation, 71 -- 77, 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