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
Speed is as powerful as clairvoyance
Journal of the ACM (JACM)
Theoretical Computer Science - Selected papers in honor of Manuel Blum
Algorithms for minimizing weighted flow time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Minimizing total flow time and total completion time with immediate dispatching
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Server scheduling in the Lp norm: a rising tide lifts all boat
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Minimizing flow time nonclairvoyantly
Journal of the ACM (JACM)
Online Scheduling to Minimize Average Stretch
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A maiden analysis of Longest Wait First
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Speed scaling for weighted flow time
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Energy-Efficient algorithms for flow time minimization
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
On the average sojourn time under M/M/1/SRPT
Operations Research Letters
Scalably scheduling processes with arbitrary speedup curves
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Speed scaling with an arbitrary power function
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
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
Non-clairvoyant speed scaling for batched parallel jobs on multiprocessors
Proceedings of the 6th ACM conference on Computing frontiers
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Speed scaling of processes with arbitrary speedup curves on a multiprocessor
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Throughput loss in task scheduling due to server state uncertainty
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Scheduling jobs with varying parallelizability to reduce variance
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Scalably scheduling power-heterogeneous processors
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
How to schedule when you have to buy your energy
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Minimizing maximum flowtime of jobs with arbitrary parallelizability
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
SIAM Journal on Computing
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
Dispatching equal-length jobs to parallel machines to maximize throughput
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Longest wait first for broadcast scheduling [extended abstract]
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Proceedings of the 3rd International Conference on Future Energy Systems: Where Energy, Computing and Communication Meet
Scalably scheduling processes with arbitrary speedup curves
ACM Transactions on Algorithms (TALG)
Providing performance guarantees in multipass network processors
IEEE/ACM Transactions on Networking (TON)
FIFO queueing policies for packets with heterogeneous processing
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Speed Scaling with an Arbitrary Power Function
ACM Transactions on Algorithms (TALG)
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
A segmentation approach for file broadcast scheduling
Journal of Parallel and Distributed Computing
Competitive online adaptive scheduling for sets of parallel jobs with fairness and efficiency
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Our goal here is to illustrate the competitive online scheduling research community's approach to online server scheduling problems by enumerating some of the results obtained for problems related to response and slowdown, and by explaining some of the standard analysis techniques.