HANDLING BLOCKING SYSCALLS
DATA STRUCTURE FOR TASKS THAT DO NOT YET HAVE A CORE (Slow path for thread creation)
LOGICAL CONCURRENCY VS DESIRED PARALLELISM (CORE COUNT)
TIMING GUARANTEES UNDER COOPERATIVE THREADING
BENEFITS / SELLING POINTS / CONTRIBUTIONS
KERNEL API
CORE NEGOTIATION PROTOCOL
MINIMUM TIME TO SCHEDULE A THREAD ONTO ANOTHER CORE
What is the correct architecture for the fast path, and what is the lowest possible time to schedule to another core?
DEFINITION OF CORE AWARE