On-line multi-threaded paging

DOI10.1007/S00453-001-0073-ZMaRDI QIDQ5956831zbMATH OpenOpenAlexFDO

Authors E. Feuerstein, Alejandro Strejilevich De Loma

Publication date 28 February 2002

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-001-0073-z

zbMATH Keywords

paging

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• On multi-threaded Paging
• scientific article; zbMATH DE number 1264493
• Competitive paging algorithms
• A strongly competitive randomized paging algorithm
• scientific article; zbMATH DE number 1383708

Cited in

(14)

• Paging more than one page
• Approximation algorithms for scheduling on multi-core processor with shared speedup resources
• Combining request scheduling with web caching
• Multiple spin-block decisions
• scientific article; zbMATH DE number 1629982 (Why is no real title available?)
• Paging for multi-core shared caches
• Online Paging for Flash Memory Devices
• scientific article; zbMATH DE number 1264493 (Why is no real title available?)
• scientific article; zbMATH DE number 2079385 (Why is no real title available?)
• scientific article; zbMATH DE number 1383708 (Why is no real title available?)
• Randomized online multi-threaded paging
• On multi-threaded Paging
• Online min-max paging
• On multi-threaded metrical task systems

This page was built for publication: On-line multi-threaded paging

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