Multicore Paging Algorithms Cannot Be Competitive
Name
3350755.3400270.pdf
Size
1.15 MB
Format
Adobe PDF
Checksum (MD5)
ce39e4b22bfb2a4421220f8603d3f45d
Author(s)
Xu, Helen
Kamali, Shahin
Date Issued
July 6, 2020
Publisher
ACM|Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures CD-ROM
Citation
Xu, Helen and Kamali, Shahin. 2020. "Multicore Paging Algorithms Cannot Be Competitive."
Version
Final published version
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/3350755.3400270
