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

PRIORITIES AND STARVATION

BENEFITS / SELLING POINTS / CONTRIBUTIONS

LOAD BALANCING BETWEEN CORES

USER API

KERNEL API

CORE NEGOTIATION PROTOCOL

Mostly Solved Issues

MINIMUM TIME TO SCHEDULE A THREAD ONTO ANOTHER CORE

 

DEFINITION OF CORE AWARE