Upper bounds for multi-level multi-server paging

DOI10.1016/J.IPL.2018.10.012zbMath1470.68034OpenAlexW2898480325MaRDI QIDQ1628694

Anat Eyal, Shlomi Dolev, Marina Kogan-Sadetsky, Philip Derbeko, Danny Hendler

Publication date: 5 December 2018

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2018.10.012

zbMATH Keywords

distributed systemsdistributed computingconcurrencymulti-level shared cacheoptimal offline polynomial paging algorithm

Mathematics Subject Classification ID

Distributed systems (68M14)

Cites Work

• Paging for multi-core shared caches
• Unnamed Item

This page was built for publication: Upper bounds for multi-level multi-server paging