B. Awerbuch, Y. Azar, S. Leonardi, and O. Regev. Minimizing the flow time without migration. In ACM Symposium on Theory of Computing, pages 198--205, 1999.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....case. Next, we give lower bounds for algorithms using resource augmentation on the speed. Finally, we consider scheduling with hard deadlines. 1 Introduction Minimizing the total flow time is a well known and hard problem, which has been studied widely both in on line and in off line environments [1, 7, 8]. The flow time f(J) of a job J is defined as its completion time, C(J) minus the time at which it arrived, r(J) the release time of J) This measure is applicable to systems where the load is proportional to the total number of bits that exist in the system over time (both of running jobs and ....

B. Awerbuch, Y. Azar, S. Leonardi, and O. Regev. Minimizing the flow time without migration. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 198--205, 1999.

....problem from a different perspective, as a special case of weighted flow time. Based on this view we develop a new and simple algorithm and show that it provides improved competitive ratios for the problem. Further our algorithm allows for a much simpler analysis. Related Work: Awerbuch et al. [2] developed an online algorithm that does not migrate jobs between preemptions and showed that for unweighted flow time, the competitive ratio of their algorithm essentially matches that of SRPT. Becchetti et al. 4] showed that the algorithm in [2] provides an O(1) ratio for the total stretch ....

....simpler analysis. Related Work: Awerbuch et al. 2] developed an online algorithm that does not migrate jobs between preemptions and showed that for unweighted flow time, the competitive ratio of their algorithm essentially matches that of SRPT. Becchetti et al. 4] showed that the algorithm in [2] provides an O(1) ratio for the total stretch metric without migration. A metric that is closely related to flow time is completion time; they differ in value by an additive term that is independent of the schedule. Thus the optimal value for one metric directly yields the optimal value for the ....

[Article contains additional citation context not shown here]

B. Awerbuch, Y. Azar, S. Leonardi, and O. Regev. Minimizing flow time without migration. In Proceedings of the 31st ACM Symposium on the Theory of Computing, pages 198--205, 1999.

....competitive analysis, resource augmentation Note: Work carried out under theme SEN4 Evolutionary Systems and Applied Algorithmics . 1. Introduction Minimizing the total flow time is a well known and hard problem, which has been studied widely both in on line and in o# line environments [1, 8, 9]. The flow time f(J) of a job J is defined as its completion time, C(J ) minus the time at which it arrived, r(J) the release time of J) This measure is applicable to systems where the load is proportional to the total number of bits that exist in the system over time (both of running jobs and ....

B. Awerbuch, Y. Azar, S. Leonardi, and O. Regev. Minimizing the flow time without migration. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 198--205, 1999.

....is limited [8] In multiprocessors, a potential drawback of SRPT is the overhead it incurs due to migrations. Recall that SRPT may preempt a job at one processor and later resume the job at a different processor. A natural variant of SRPT that does not perform any migrations has been proposed in [1]. In recent work [3] it has been shown that the migrationless scheduling algorithm of [1] also achieves a constant factor competitive ratio with respect to average stretch. Many interesting problems remain open. In particular, the lower bounds may quite possibly be strengthened. Also, it will ....

....due to migrations. Recall that SRPT may preempt a job at one processor and later resume the job at a different processor. A natural variant of SRPT that does not perform any migrations has been proposed in [1] In recent work [3] it has been shown that the migrationless scheduling algorithm of [1] also achieves a constant factor competitive ratio with respect to average stretch. Many interesting problems remain open. In particular, the lower bounds may quite possibly be strengthened. Also, it will be of interest to analyze the algorithm that schedules the job i with the smallest p(i)ae t ....

B. Awerbuch, Y. Azar, S. Leonardi, and O. Regev. Minimizing flow time without migration. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 198--205, May 1999.

No context found.

B. Awerbuch, Y. Azar, S. Leonardi, and O. Regev. Minimizing the Flow Time without Migration. In Proc. ACM Symposium on the Theory of Computing (STOC '99), 1999.

.... The weighted flow time problem 1jr i ; pmtnj P w i Delta F i is a special case of the broadcast problem where all requests for file i arrive at a single time r i (however, there may be many requests for i at time r i ) There have been some recent results on minimizing average flow time [1, 8, 10, 4]; however, minimizing weighted flow time is not yet well understood. In fact, the uniprocessor offline problem Dipartimento di Informatica e Sistemistica, Universit a di Roma La Sapienza . fbecchetti,leon,albertog dis.uniroma1.it. Partially supported by the IST Programme of the EU under contract ....

B. Awerbuch, Y. Azar, S. Leonardi, and O. Regev. Minimizing the Flow Time without Migration. In Proc. ACM Symposium on the Theory of Computing (STOC '99), 1999.

No context found.

B. Awerbuch, Y. Azar, S. Leonardi, and O. Regev. Minimizing the flow time without migration. In ACM Symposium on Theory of Computing, pages 198--205, 1999.

No context found.

B. Awerbuch, Y. Azar, S. Leonardi and O. Regev. Minimizing flow time without migration. Proc. of STOC, 1999.

No context found.

B. Awerbuch, Y. Azar, S. Leonardi, and O. Regev. Minimizing the flow time without migration. SIAM Journal on Computing, 31:1370--1382, 2001.

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