On page migration and other relaxed task systems

DOI10.1016/S0304-3975(00)00259-0zbMath0992.68010MaRDI QIDQ5958713

Piotr Indyk, Yair Bartal, Moses Charikar

Publication date: 3 March 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

on-line algorithmspage migrationrelaxed task systems

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (11)

On-line generalized Steiner problem ⋮ Serving Online Requests with Mobile Servers ⋮ A \(3 + \Omega (1)\) lower bound for page migration ⋮ Dynamic Balanced Graph Partitioning ⋮ Competitive clustering of stochastic communication patterns on a ring ⋮ Uniform page migration problem in Euclidean space ⋮ Cost thresholds for dynamic resource location ⋮ Dynamic replication of web contents ⋮ Managing multiple mobile resources ⋮ Optimal algorithms for page migration in dynamic networks ⋮ Asymptotically optimal online page migration on three points

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Competitive algorithms for distributed data management.
• On the power of randomization in on-line algorithms
• An Optimal On-Line Algorithm for K Servers on Trees
• Competitive algorithms for server problems
• Database Location in Computer Networks
• Distributed Paging for General Networks
• Competitive On-Line Algorithms for Distributed Data Management
• An optimal on-line algorithm for metrical task system
• Page Migration Algorithms Using Work Functions
• On the k -server conjecture
• Competitive distributed file allocation

This page was built for publication: On page migration and other relaxed task systems