Claude-skill-registry fiber-scheduling-theory
Apply deep knowledge of Fiber scheduling to reason about rendering priorities, preemption, and starvation avoidance.
install
source · Clone the upstream repo
git clone https://github.com/majiayu000/claude-skill-registry
Claude Code · Install into ~/.claude/skills/
T=$(mktemp -d) && git clone --depth=1 https://github.com/majiayu000/claude-skill-registry "$T" && mkdir -p ~/.claude/skills && cp -r "$T/skills/data/fiber-scheduling-theory" ~/.claude/skills/majiayu000-claude-skill-registry-fiber-scheduling-theory && rm -rf "$T"
manifest:
skills/data/fiber-scheduling-theory/SKILL.mdsource content
Fiber Scheduling Theory (React 18)
Summary
Apply deep knowledge of Fiber scheduling to reason about rendering priorities, preemption, and starvation avoidance.
Key Capabilities
- Interpret scheduler lanes and priority escalation behavior.
- Model preemption effects on UI atomicity guarantees.
- Diagnose starvation risks and mitigate via boundary design.
PhD-Level Challenges
- Construct a formal scheduling model for multi-lane updates.
- Derive starvation bounds under adversarial update patterns.
- Evaluate performance regressions using synthetic lane stress tests.
Acceptance Criteria
- Present a lane diagram for a complex interaction scenario.
- Validate that high-priority input stays responsive under load.
- Explain trade-offs in at least two real scheduling decisions.