Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Cache-Efficient Parallel-Partition Algorithms using Exclusive-Read-and-Write Memory

Cache-Efficient Parallel-Partition Algorithms using Exclusive-Read-and-Write Memory

Thumbnail Image
Download
Name

3350755.3400234.pdf

Size

921.28 KB

Format

Adobe PDF

Checksum (MD5)

7e41060a409e74e4233ba13575cdb377

Download all files submitted through automated deposit
3350755.3400234.zip (916.5 KB)
Author(s)
Westover, Alek
•
Kuszmaul, William
Date Issued
July 6, 2020
Publisher
ACM|Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures CD-ROM
Citation
Westover, Alek and Kuszmaul, William. 2020. "Cache-Efficient Parallel-Partition Algorithms using Exclusive-Read-and-Write Memory."
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
https://hdl.handle.net/1721.1/146212
DOI of Published Version
https://doi.org/10.1145/3350755.3400234
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.