Multiprocessor Online Scheduling of Hard-Real-Time Tasks
IEEE Transactions on Software Engineering
Approximating total flow time on parallel machines
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Optimal time-critical scheduling via resource augmentation (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Improved Bounds for the Online Scheduling Problem
SIAM Journal on Computing
A scheduling model for reduced CPU energy
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Optimal online bounded space multidimensional packing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Windows scheduling as a restricted version of Bin Packing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
SRPT optimally utilizes faster machines to minimize flow time
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Caching queues in memory buffers
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Buffer minimization using max-coloring
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A general approach to online network optimization problems
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Competitive analysis of organization networks or multicast acknowledgement: how much to wait?
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Randomized k-server algorithms for growth-rate bounded graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A maiden analysis of Longest Wait First
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Non-migratory online deadline scheduling on multiprocessors
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Minimizing migrations in fair multiprocessor scheduling of persistent tasks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Routing and scheduling in multihop wireless networks with time-varying channels
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On the performance of greedy algorithms in packet buffering
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Adaptive routing with end-to-end feedback: distributed learning and geometric approaches
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The zero-one principle for switching networks
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The all-or-nothing multicommodity flow problem
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Multi-processor scheduling to minimize flow time with ε resource augmentation
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Dynamic Speed Scaling to Manage Energy and Temperature
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Lower and upper bounds on FIFO buffer management in QoS switches
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
A survey of buffer management policies for packet switches
ACM SIGACT News
Competitive analysis of scheduling algorithms for aggregated links
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
| Hi-index | 0.00 |
This column contains a summary of last year's research on online algorithms presented at the STOC, FOCS, ICALP, ESA, and STACS conferences. Unfortunately, due to space constraints, the report could not be entirely exhaustive, and results from other conferences or journal articles are not covered. We hope that all readers will find in the survey something of interest, to fill those long winter evenings. The papers in the report are organized roughly by applications.