Amortized efficiency of list update and paging rules
Communications of the ACM
Amortized analyses of self-organizing sequential search heuristics
Communications of the ACM - Lecture notes in computer science Vol. 174
Self-organizing sequential search and Hilbert's inequalities
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
On self-organizing sequential search heuristics
Communications of the ACM
Heuristics that dynamically alter data structures to reduce their access time.
Heuristics that dynamically alter data structures to reduce their access time.
Competitive algorithms for on-line problems
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Online algorithms for locating checkpoints
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Random walks on weighted graphs, and applications to on-line algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Navigating in unfamiliar geometric terrain
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Competitive paging with locality of reference
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Infinite games: randomization, computability, and applications to online problems
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Randomized competitive algorithms for the list update problem
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Competitive algorithms for distributed data management (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Distributed algorithms for dynamic replication of data
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Random walks on weighted graphs and applications to on-line algorithms
Journal of the ACM (JACM)
On trading task reallocation for thread management in partitionable multiprocessors
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
On traversing layered graphs on-line
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
On-line choice of on-line algorithms
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
On-line generalized Steiner problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Randomized robot navigation algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
On page migration and other relaxed task systems
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A competitive 3-server algorithm
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
New results on server problems
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Competitive randomized algorithms for non-uniform problems
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Optimal Projective Algorithms for the List Update Problem
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
The CNN Problem and Other k-Server Variants
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On Multicriteria Online Problems
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Can competitive analysis be made competitive?
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1
FlashDB: dynamic self-tuning database for NAND flash
Proceedings of the 6th international conference on Information processing in sensor networks
Uniform metrical task systems with a limited number of states
Information Processing Letters
Reasoning about online algorithms with weighted automata
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Reasoning about online algorithms with weighted automata
ACM Transactions on Algorithms (TALG)
A competitive online algorithm for the paging problem with "shelf" memory
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
On the bicriteria k-server problem
ACM Transactions on Algorithms (TALG)
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Computer Science Review
Efficient implementation of a multi-dimensional index structure over flash memory storage systems
The Journal of Supercomputing
| Hi-index | 0.00 |
In practice, almost all dynamic systems require decisions to be made online, without full knowledge of their future impact on the system. We introduce a general model for the processing of sequences of tasks and develop a general online decision algorithm. We show that, for an important class of special cases, this algorithm is optimal among all online algorithms.Specifically, a task system (S, d) for processing sequences of tasks consists of a set S of states and a cost matrix d where d(i, j) is the cost of changing from state i to state j (we assume that d satisfies the triangle inequality and all diagonal entries are O.) The cost of processing a given task depends on the state of the system. A schedule for a sequence T1, T2 … Tk of tasks is a sequence s1, s2 … sk of states where si is the state in which Ti is processed; the cost of a schedule is the sum of all task processing costs and state transition costs incurred.An online scheduling algorithm is one that chooses si only knowing T1 T2 … Ti. Such an algorithm operates within waste factor w if, on any input task sequence, its costs is within an additive constant of w times the optimal offline schedule cost. The online waste factor w(S, d) is the infirm waste factor of any online scheduling algorithm for (S, d). We show that w(S, d) = 2|S| - 1 for every task system in which d symmetric, and w(S, d) = &Ogr;(|S|2) for every task system.