Skip to content

Author

Kunal Agrawal

We have 2 of 13 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Non-Clairvoyant Scheduling is Hard Even for Trees

It is shown that First-In-First-Out (FIFO) has competitive ratio $\Omega(\log m)$ even when every job is an out-tree, and a lower bound is proved of $\Omega(\min\{m,\mathrm{OPT}\})$ for every non-clairvoyant online algorithm, where $\mathrm{OPT}$ is the maximum flow time of an optimal offline schedule.

Kunal Agrawal, Owen Druzgal, M. Prabhu et al. · 0 citations
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. · 2 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.