How useful is old information (extended abstract)?

DOI10.1145/259380.259426zbMath1373.68113OpenAlexW2058811846MaRDI QIDQ5361470

Michael Mitzenmacher

Publication date: 29 September 2017

Published in: Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/259380.259426

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Related Items (5)

Adaptive routing with stale information ⋮ Practical load balancing for content requests in peer-to-peer networks ⋮ Load balancing without regret in the bulletin board model ⋮ Randomized allocation processes ⋮ Delayed information and action in on-line algorithms

This page was built for publication: How useful is old information (extended abstract)?