On multi-threaded metrical task systems

DOI10.1016/J.JDA.2005.12.005zbMath1103.68968OpenAlexW1999984811MaRDI QIDQ849631

Alejandro Strejilevich De Loma, Esteban Feuerstein, Steven S. Seiden

Publication date: 31 October 2006

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2005.12.005

zbMATH Keywords

competitive analysison-line algorithmspagingmulti-tasking systems

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A strongly competitive randomized paging algorithm
• Competitive snoopy caching
• On the power of randomization in on-line algorithms
• On algorithm design for metrical task systems
• Competitive paging with locality of reference
• On-line multi-threaded scheduling
• A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems
• The k-Client Problem
• Competitive algorithms for server problems
• An optimal on-line algorithm for metrical task system
• Application-Controlled Paging for a Shared Cache
• Algorithms for the on-line travelling salesman
• On-line multi-threaded paging
• Interleaved prefetching
• On-line single-server dial-a-ride problems

This page was built for publication: On multi-threaded metrical task systems