Upper bounds for multi-level multi-server paging
type: Item
instance of: scholarly article
title: Upper bounds for multi-level multi-server paging
zbMATH Open document ID: 1470.68034
author: Shlomi Dolev
author: A. Eyal
author: Danny Hendler
author: Philip Derbeko
author: Marina Kogan-Sadetsky
published in: Information Processing Letters
publication date: 2018-12-05T00:00:00Z
Mathematics Subject Classification ID: 68M14
zbMATH DE Number: 6989092
zbMATH Keywords: distributed systems
zbMATH Keywords: distributed computing
zbMATH Keywords: concurrency
zbMATH Keywords: multi-level shared cache
zbMATH Keywords: optimal offline polynomial paging algorithm
MaRDI profile type: Publication
full work available at URL: j.ipl.2018.10.012
OpenAlex ID: W2898480325
cites work: Paging for multi-core shared caches
cites work: Q4876409
DOI: 10.1016/J.IPL.2018.10.012
description: scientific article; zbMATH DE number 6989092