An Analysis of Zero-Clairvoyant Scheduling
Abstract elided by the publisher.
Related papers
- Totally Clairvoyant Scheduling with Relative Timing Constraints VMCAI 2006
- Clairvoyance: look-ahead compile-time scheduling CGO 2017
- Call-by-need is clairvoyant call-by-value ICFP 2019
- Zero-cost Range Splitting PLDI 1994
- Reasoning about the garden of forking paths ICFP 2021
- Pipelonk: Accelerating End-to-End Zero-Knowledge Proof Generation on GPUs for PLONK-Based Protocols PPoPP 2026
- Mario: Near Zero-cost Activation Checkpointing in Pipeline Parallelism PPoPP 2025
- Contention in Structured Concurrency: Provably Efficient Dynamic Non-Zero Indicators for Nested Parallelism PPoPP 2017