Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

On multi-threaded Paging

From MaRDI portal
Publication:5871887
Jump to:navigation, search

DOI10.1007/BFB0009518zbMATH Open1503.68305OpenAlexW1542169461MaRDI QIDQ5871887FDOQ5871887


Authors: E. Feuerstein, Alejandro Strejilevich De Loma Edit this on Wikidata


Publication date: 25 January 2023

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0009518




Recommendations

  • On-line multi-threaded paging
  • Randomized online multi-threaded paging
  • scientific article; zbMATH DE number 1383708
  • Paging for multi-core shared caches
  • scientific article; zbMATH DE number 1264493
  • Uniform multipaging reduces to paging
  • On paging with locality of reference
  • On the separation and equivalence of paging strategies


Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Theory of operating systems (68N25)


Cites Work

  • Title not available (Why is that?)
  • Competitive snoopy caching
  • An optimal on-line algorithm for metrical task system


Cited In (6)

  • On-line multi-threaded paging
  • Randomized online multi-threaded paging
  • Uniform multipaging reduces to paging
  • Paging more than one page
  • Paging for multi-core shared caches
  • Title not available (Why is that?)





This page was built for publication: On multi-threaded Paging

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5871887)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5871887&oldid=30738145"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 March 2024, at 05:55. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki