Multicore Paging Algorithms Cannot Be Competitive

dc.contributor.author	Xu, Helen
dc.contributor.author	Kamali, Shahin
dc.date.accessioned	2022-11-09T17:01:59Z
dc.date.available	2022-11-09T17:01:59Z
dc.date.issued	2020-07-06
dc.identifier.isbn	978-1-4503-6935-0
dc.identifier.uri	https://hdl.handle.net/1721.1/146238
dc.publisher	ACM\|Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures CD-ROM	en_US
dc.relation.isversionof	https://doi.org/10.1145/3350755.3400270	en_US
dc.rights	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.	en_US
dc.source	ACM\|Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures CD-ROM	en_US
dc.title	Multicore Paging Algorithms Cannot Be Competitive	en_US
dc.type	Article	en_US
dc.identifier.citation	Xu, Helen and Kamali, Shahin. 2020. "Multicore Paging Algorithms Cannot Be Competitive."
dc.contributor.department	Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
dc.identifier.mitlicense	PUBLISHER_POLICY
dc.eprint.version	Final published version	en_US
dc.type.uri	http://purl.org/eprint/type/ConferencePaper	en_US
eprint.status	http://purl.org/eprint/status/NonPeerReviewed	en_US
dc.date.updated	2022-11-02T20:29:40Z
dc.language.rfc3066	en
dc.rights.holder	The author(s)
dspace.date.submission	2022-11-02T20:29:41Z
mit.license	PUBLISHER_POLICY
mit.metadata.status	Authority Work and Publication Information Needed	en_US