Book
Open access
Jul 2026
Non-Clairvoyant Scheduling for Processing-in-Memory
This work develops a non-clairvoyant scheduling algorithm that does not know task work in advance, yet loses only a small additive term relative to the clairvoyant lower bound, and proves a performance upper bound under uniform random data placement.
H. Kang, Yiwei Zhao, Kunal Agrawal et al.
· ACM Symposium on Parallelism... · 2 citations