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
Competitive algorithms for server problems
Journal of Algorithms
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
On the power of randomization in online algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
An optimal on-line algorithm for K-servers on trees
SIAM Journal on Computing
The harmonic online K-server algorithm is competitive
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
New results on server problems
SIAM Journal on Discrete Mathematics
Journal of Algorithms
On self-organizing sequential search heuristics
Communications of the ACM
Memory Versus Randomization in On-line Algorithms (Extended Abstract)
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Heuristics that dynamically alter data structures to reduce their access time.
Heuristics that dynamically alter data structures to reduce their access time.
Memory versus randomization in on-line algorithms
IBM Journal of Research and Development
A probabilistic approach to the problem of automatic selection of data representations
Proceedings of the first ACM SIGPLAN international conference on Functional programming
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
A polylog(n)-competitive algorithm for metrical task systems
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On-line learning and the metrical task system problem
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Competitive solutions for online financial problems
ACM Computing Surveys (CSUR)
TCP dynamic acknowledgment delay (extended abstract): theory and practice
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On algorithm design for metrical task systems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
The statistical adversary allows optimal money-making trading strategies
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Routing and admission control in general topology networks with Poisson arrivals
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Online list accessing algorithms and their applications: recent empirical evidence
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Linear programs for randomized on-line algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Design of on-line algorithms using hitting times
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
On-line complexity of monotone set systems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
ACM Computing Surveys (CSUR)
A guessing game and randomized online algorithms
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Better algorithms for unfair metrical task systems and applications
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On-line Learning and the Metrical Task System Problem
Machine Learning
On-line analysis of the TCP acknowledgment delay problem
Journal of the ACM (JACM)
Online server allocation in a server farm via benefit task systems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A new lower bound for the list update problem in the partial cost model
Theoretical Computer Science
On page migration and other relaxed task systems
Theoretical Computer Science
Delayed information and action in on-line algorithms
Information and Computation
A general decomposition theorem for the k-server problem
Information and Computation
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
On the On-line Number of Snacks Problem
Journal of Global Optimization
On list update and work function algorithms
Theoretical Computer Science
Multi-embedding and path approximation of metric spaces
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A New Competitive Analysis of Randomized Caching
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Average-Case Competitive Analyses for Ski-Rental Problems
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
A Decentralized Algorithm for Coordinating Independent Peers: An Initial Examination
On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002
A General Decomposition Theorem for the k-Server Problem
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Randomized online multi-threaded paging
Nordic Journal of Computing
On metric ramsey-type phenomena
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On Randomization In Online Computation
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On-line generalized Steiner problem
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
The CNN problem and other k-server variants
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Competitive Analysis for the On-line Truck Transportation Problem
Journal of Global Optimization
Online pricing for web service providers
Proceedings of the 2006 international workshop on Economics driven software engineering research
The generalized two-server problem
Journal of the ACM (JACM)
Ramsey-type theorems for metric spaces with applications to online problems
Journal of Computer and System Sciences - Special issue on FOCS 2001
Topology matters: smoothed competitiveness of metrical task systems
Theoretical Computer Science
IEEE Transactions on Mobile Computing
Uniform metrical task systems with a limited number of states
Information Processing Letters
Competitiveness via primal-dual
ACM SIGACT News
Online chasing problems for regular polygons
Information Processing Letters
Dynamic coprocessor management for FPGA-enhanced compute platforms
CASES '08 Proceedings of the 2008 international conference on Compilers, architectures and synthesis for embedded systems
Dynamic tuning of configurable architectures: the AWW online algorithm
CODES+ISSS '08 Proceedings of the 6th IEEE/ACM/IFIP international conference on Hardware/Software codesign and system synthesis
Proceedings of the VLDB Endowment
Adaptive Physical Design for Curated Archives
SSDBM 2009 Proceedings of the 21st International Conference on Scientific and Statistical Database Management
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
Online Computation with Advice
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
A competitive algorithm for the general 2-server problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On the on-line k-taxi problem with limited look ahead
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Randomized priority algorithms
Theoretical Computer Science
Dynamic acceleration management for SystemC emulation
ACM SIGBED Review - Special Issue on the 2nd International Workshop on Adaptive and Reconfigurable Embedded Systems (APRES'09)
Towards the randomized k-server conjecture: a primal-dual approach
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Metrical task systems and the k-server problem on HSTs
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
A regularization approach to metrical task systems
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Online computation with advice
Theoretical Computer Science
Online job-migration for reducing the electricity bill in the cloud
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part I
Online strategies for intra and inter provider service migration in virtual networks
IPTcomm '11 Proceedings of the 5th International Conference on Principles, Systems and Applications of IP Telecommunications
Semi-automatic index tuning: keeping DBAs in the loop
Proceedings of the VLDB Endowment
Computer Science Review
A Primal-Dual Randomized Algorithm for Weighted Paging
Journal of the ACM (JACM)
Online optimization with switching cost
ACM SIGMETRICS Performance Evaluation Review
Dynamic right-sizing for power-proportional data centers
IEEE/ACM Transactions on Networking (TON)
The Wide-Area Virtual Service Migration Problem: A Competitive Analysis Approach
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.01 |
In practice, almost all dynamic systems require decisions to be made on-line, without full knowledge of their future impact on the system. A general model for the processing of sequences of tasks is introduced, and a general on-line decision algorithm is developed. It is shown that, for an important class of special cases, this algorithm is optimal among all on-line 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 0). 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 the state transition costs incurred.An on-line scheduling algorithm is one that chooses si only knowing T1T2…Ti. Such an algorithm is w-competitive if, on any input task sequence, its cost is within an additive constant of w times the optimal offline schedule cost. The competitive ratio w(S, d) is the infimum w for which there is a w-competitive on-line scheduling algorithm for (S,d). It is shown that w(S, d) = 2|S|–1 for every task system in which d is symmetric, and w(S, d) = O(|S|2) for every task system. Finally, randomized on-line scheduling algorithms are introduced. It is shown that for the uniform task system (in which d(i,j) = 1 for all i,j), the expected competitive ratio w¯(S,d) = O(log|S|).