Reallocation problems in scheduling

Authors:
Michael A. Bender;Martin Farach-Colton;Sándor Fekete;Jeremy T. Fineman;Seth Gilbert
Affiliations:
Stony Brook University & Tokutek, Stony Brook & New York, NY, USA;Rutgers University, New Brunswick, NJ & Tokutek, New York, NY, USA;TU Braunschweig, Braunschweig, Germany;Georgetown University, Washington D.C., USA;National University of Singapore, Singapore, Singapore
Venue:
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Year:
2013

Citing 22
Cited 0

Good worst-case algorithms for inserting and deleting records in dense sequential files

SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time

Information and Computation
Load balancing for response time

Journal of Algorithms
Speed is as powerful as clairvoyance

Journal of the ACM (JACM)
Minimizing the Flow Time Without Migration

SIAM Journal on Computing
A Sparse Table Implementation of Priority Queues

Proceedings of the 8th Colloquium on Automata, Languages and Programming
Maintaining dense sequential files in a dynamic environment (Extended Abstract)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Average stretch without migration

Journal of Computer and System Sciences
Rescheduling for New Orders

Operations Research
Online topological ordering

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Planning for Robust Airline Operations: Optimizing Aircraft Routings and Flight Departure Times to Minimize Passenger Disruptions

Transportation Science
An adaptive packed-memory array

ACM Transactions on Database Systems (TODS)
Non-Preemptive Min-Sum Scheduling with Resource Augmentation

FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Faster Algorithms for Incremental Topological Ordering

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
A new approach to incremental topological ordering

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Online Scheduling with Bounded Migration

Mathematics of Operations Research
Dynamic Airline Scheduling

Transportation Science
Reoptimization of minimum and maximum traveling salesman's tours

Journal of Discrete Algorithms
Reoptimizing the 0-1 knapsack problem

Discrete Applied Mathematics
Online algorithms to minimize resource reallocations and network communication

APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Dynamic Defragmentation of Reconfigurable Devices

ACM Transactions on Reconfigurable Technology and Systems (TRETS)
A theory and algorithms for combinatorial reoptimization

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In traditional on-line problems, such as scheduling, requests arrive over time, demanding available resources. As each request arrives, some resources may have to be irrevocably committed to servicing that request. In many situations, however, it may be possible or even necessary to reallocate previously allocated resources in order to satisfy a new request. This reallocation has a cost. This paper shows how to service the requests while minimizing the reallocation cost. We focus on the classic problem of scheduling jobs on a multiprocessor system. Each unit-size job has a time window in which it can be executed. Jobs are dynamically added and removed from the system. We provide an algorithm that maintains a valid schedule, as long as a sufficiently feasible schedule exists. The algorithm reschedules only O(min{log* n; log* Δ}) jobs for each job that is inserted or deleted from the system, where n is the number of active jobs and Δ is the size of the largest window.