The k-Client Problem

DOI10.1006/jagm.2001.1182zbMath1017.68059OpenAlexW2042812166MaRDI QIDQ2775884

Stephen Wagner, Houman Alborzi, Patchrawat Uthaisombut, Eric Torng

Publication date: 8 July 2002

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

Full work available at URL: https://doi.org/10.1006/jagm.2001.1182

zbMATH Keywords

multithreaded online systemssingle-threaded systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Related Items (6)

Combining request scheduling with web caching ⋮ Competitive caching of query results in search engines ⋮ Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities ⋮ On multi-threaded metrical task systems ⋮ On the remote server problem or more about TCP acknowledgments ⋮ An adversarial queueing model for online server routing

This page was built for publication: The k-Client Problem