Surpassing the information theoretic bound with fusion trees
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Approximating total flow time on parallel machines
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Dynamic scheduling with incomplete information
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Scheduling on-demand broadcasts: new metrics and algorithms
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Scheduling data transfers in a network and the set scheduling problem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Flow and stretch metrics for scheduling continuous job streams
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On choosing a task assignment policy for a distributed server system
Journal of Parallel and Distributed Computing - Special issue on software support for distributed computing
Downlink scheduling in CDMA data networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Algorithms for minimizing weighted flow time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Minimizing flow time nonclairvoyantly
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Online Scheduling to Minimize Average Stretch
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Connection scheduling in web servers
USITS'99 Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems - Volume 2
Approximation schemes for preemptive weighted flow time
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Non-clairvoyant Scheduling for Minimizing Mean Slowdown
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Server scheduling in the Lp norm: a rising tide lifts all boat
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Approximation Algorithms for Average Stretch Scheduling
Journal of Scheduling
Scheduling data transfers in a network and the set scheduling problem
Journal of Algorithms
Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
Journal of the ACM (JACM)
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
The Granularity Metric for Fine-Grain Real-Time Scheduling
IEEE Transactions on Computers
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Minimizing the stretch when scheduling flows of biological requests
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling
Theoretical Computer Science
ACM Transactions on Algorithms (TALG)
Minimizing the stretch when scheduling flows of divisible requests
Journal of Scheduling
Online scheduling to minimize the maximum delay factor
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Weighted flow time does not admit O(1)-competitive algorithms
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Fair, effective, efficient and differentiated scheduling in an enterprise data warehouse
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
A moldable online scheduling algorithm and its application to parallel short sequence mapping
JSSPP'10 Proceedings of the 15th international conference on Job scheduling strategies for parallel processing
An online scalable algorithm for minimizing lk-norms of weighted flow time on unrelated machines
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Minimizing maximum (weighted) flow-time on related and unrelated machines
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
A segmentation approach for file broadcast scheduling
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
We study the basic problem of preemptive scheduling of an online stream of jobs on a single processor. The ith job arrives at time r(i) and has processing time p(i) that is known at the time of its arrival. If C(i) is the completion time of job i, then the flow time is C(i) - r(i) and stretch of a job is the ratio of its flow time to its processing time; that is, C(i)-r(i)/p(i). Flow time considers the time a job is in the system regardless of the service it requested; the stretch measure relies on the intuition that a job that requested long service must be prepared to wait longer than the small jobs.In this paper, we present improved algorithmic results in stretch scheduling. We first show that a simple online algorithm that takes amortized O(1) time per job arrival is O(Δ1/2)-competitive with respect to maximum stretch, where Δ is the ratio of the largest processing time to the smallest processing time. This is significantly more efficient than the best known online algorithm for this problem which takes ω(n2) per scheduling step (n is the number of jobs seen thus far). We next present a polynomial time approximation scheme for average stretch scheduling. The previous best polynomial-time algorithm is the shortest remaining processing time algorithm, which achieves a 2-approximation. Finally, we consider the impact of incomplete knowledge of job sizes on the average stretch performance of scheduling algorithms. We show that a constant-factor competitive ratio for average stretch is achievable even if the processing times (or remaining processing times) of jobs are known only to within a constant factor of accuracy.