Managing High-Bandwidth Memory is a Parallel Scheduling Problem (full paper only)
Open Access
- 16 July 2025
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 171-180
Abstract
No abstract availableFunding Information
- Universitas Brawijaya (CCF-2106699, CCF-2107280, PPoSS-2216971, CCF 2247577, CCF 2106827, CCF-2209654, CCF-2121744, CCF-2218677)
- ONR (13533312, N000142212702)
This publication has 22 references indexed in Scilit:
- Tight Bounds for Parallel Paging and Green Paging2021
- Benchmarking data analysis and machine learning applications on the Intel KNL many-core processor2017
- Two-level main memory co-design: Multi-threaded algorithmic primitives, analysis, and simulationJournal of Parallel and Distributed Computing, 2017
- Two-Level Main Memory Co-Design: Multi-threaded Algorithmic Primitives, Analysis, and Simulation2015
- Competitive Cache Replacement Strategies for Shared Cache Environments2012
- Scheduling threads for constructive cache sharing on CMPs2007
- New algorithms for the disk scheduling problem2002
- New Algorithms for Disk SchedulingAlgorithmica, 2002
- On-Line Multi-Threaded PagingAlgorithmica, 2002
- Communication complexity of PRAMsTheoretical Computer Science, 1990