scheduling-algorithms

scheduling-algorithms is a skill for Claude Code from kinhluan/skills. It costs 43 tokens per session (5,885 once invoked), scanned A, original, MIT.

A reference for choosing algorithms that decide when and where jobs run on shared computing resources. It covers operating systems, parallel and distributed computers, cloud platforms, real-time systems, workflows, and machine-learning approaches.

In plain words
What is it for?
Use it to design process or thread schedulers, allocate cloud or cluster resources, optimize workflow task graphs, handle deadlines in embedded systems, and compare scheduling research.
Why use it?
It helps compare scheduling choices when tasks compete for limited processors, machines, or time before implementation.

Skill for Claude Code

Written for Claude Code: shipped in a Claude Code plugin.

Part of the kinhluan-skills plugin — 61 skills shipped together

Install

Getting it into your agent

One page per mod, every tool's command on it. A separate URL per tool would split the same page into five that compete with each other.

agentmods
npx agentmods add skills/kinhluan/skills/scheduling-algorithms
Any agent
npx skills add kinhluan/skills --skill scheduling-algorithms
Clone the repo
git clone --depth 1 https://github.com/kinhluan/skills

Made for: Claude Code.

Or install kinhluan-skills, the plugin that ships this one along with the rest of its 61 skills.

Wrote this? Show the measurements

A badge with what this costs and how it scanned, read live from this page, so it follows the numbers instead of freezing them. Markdown for a README, HTML for a documentation site or a project page.

agentmods badge for scheduling-algorithms

README.md
[![agentmods](https://agentmods.dev/badge/skills/kinhluan/skills/scheduling-algorithms.svg)](https://agentmods.dev/skills/kinhluan/skills/scheduling-algorithms)
Your own site
<a href="https://agentmods.dev/skills/kinhluan/skills/scheduling-algorithms"><img src="https://agentmods.dev/badge/skills/kinhluan/skills/scheduling-algorithms.svg" alt="Measured on agentmods" height="20"></a>
Per session 43 Skills are progressive disclosure: only the name and description are preloaded; the body loads when the skill is used.
When invoked 5,885 The whole file, excluding the scripts and references it only reads on demand.
Security scan A 0 findings. Scan, not verified.
Origin original No closer match found in the catalogue.
Token cost

What it costs to keep this loaded

Counted locally with the o200k_base tokenizer, which is exact for GPT models; Claude uses its own tokenizer and its counts differ. Treat this as one consistent yardstick across the catalogue rather than a bill. Prices are per million input tokens.

ModelPer sessionOnce invoked
Fable 5.1 $0.00043 $0.05885
Opus 5 $0.00022 $0.02942
Sonnet 5 $0.00009 $0.01177
Haiku 4.5 $0.00004 $0.00588

Measured 6d ago against content hash 17008c171c08, method: parsed. Prices are Anthropic first-party input rates as of 2026-09-06, from the pricing page.

Security

Grade A, and why

scheduling-algorithms scanned grade A with 0 findings against 26 rules in 11 categories — prompt injection, anti-refusal, data exfiltration, privilege escalation, supply chain, agent snooping, system-prompt leakage, SSRF and excessive agency — measured 6d ago.

A static scan of the body, not an audit. Every finding is printed with the line that produced it so you can judge whether it matters here. A mod is markdown that instructs an agent; that is exactly why what it instructs is worth reading.

Nothing flagged

None of the 26 patterns this scan looks for appear in this file: no shell pipes, no recursive deletes, no credential paths, no hidden text, no instruction-override or anti-refusal phrasing, no agent-config snooping. That is not a guarantee, it is the absence of the things that are checkable.

.agent-skills/scheduling-algorithms/SKILL.md · 790 lines

How it starts

The opening of the file, as written. The whole thing — 790 lines — stays where its author put it; the contents beside it link to each section on GitHub.

Scheduling Algorithms

Comprehensive guide to scheduling algorithms spanning operating systems, parallel/distributed systems, cloud computing, real-time systems, and machine learning-based approaches.

"Scheduling is the art of allocating scarce resources to competing demands over time."


1. When to Use

  • Designing OS process/thread schedulers
  • Allocating tasks in HPC clusters or cloud environments
  • Optimizing workflow execution (DAGs, task graphs)
  • Research on scheduling optimization and comparison
  • Real-time embedded systems with deadlines
  • Container orchestration and resource management

2. Fundamental OS Scheduling Algorithms

First-Come First-Served (FCFS)

Simplest non-preemptive scheduler.

Process queue: P1(24), P2(3), P3(3)
Timeline: | P1(0-24) | P2(24-27) | P3(27-30) |
Waiting times: P1=0, P2=24, P3=27  →  Avg = 17

Pros: Simple, no starvation
Cons: Convoy effect (short jobs wait behind long ones)
Complexity: O(1) per decision

Shortest Job First (SJF) / Shortest Remaining Time First (SRTF)

Optimal for minimizing average waiting time.

Preemptive (SRTF):
Arrival: P1(0,7), P2(2,4), P3(4,1), P4(5,4)
Timeline: | P1(0-2) | P2(2-4) | P3(4-5) | P2(5-7) | P4(7-11) | P1(11-16) |

Pros: Minimizes average waiting time
Cons: Requires prediction of burst time; starvation of long jobs
Prediction: Exponential averaging: τₙ₊₁ = α·tₙ + (1-α)·τₙ

Round Robin (RR)

Time-quantum based preemptive scheduling.

Quantum = 4, Processes: P1(10), P2(3), P3(5)
Timeline: | P1(0-4) | P2(4-7) | P3(7-11) | P1(11-15) | P3(15-18) | P1(18-20) |

Quantum selection:

  • Too large → FCFS behavior
  • Too small → excessive context switches (overhead > 80%)
  • Rule of thumb: 80% of CPU bursts should be < quantum

Complexity: O(1)
Best for: Time-sharing systems

Priority Scheduling

Priority queue with aging to prevent starvation:
Effective priority = Base priority + (waiting_time / aging_factor)

Read the full file on GitHub · 790 lines

Files

What ships with it

1 file beside SKILL.md in the same directory: the scripts, references and assets a skill reads on demand. Not counted in the per-session cost; read them before you install if any of them is executable.

Changes

What this file has done since we first saw it

Hashed on every crawl. A supply-chain change to an agent config is a question of when, not whether, so the history is kept rather than the latest state alone.

  1. 6d ago First seen · 790 lines · 43 tokens per session scan A 17008c171c08

Subscribe to this mod's changes

scheduling-algorithms is a skill published in the GitHub repository kinhluan/skills (4 stars, last pushed 9d ago), licensed MIT. It adds 43 tokens to every session and 5,885 once invoked, about $0.0002 per session on Opus 5. A static security scan graded it A with 0 findings. No closer match exists in the catalogue, so it is treated as the original; first seen 2026-08-31.

Related

Other skills, from other repositories

arxiv-fetch

Fetch the latest arXiv papers and generate an on-demand digest. Use when the user asks to fetch/check today's (or the latest) arXiv papers, find new papers on a topic, or generate an ad-hoc arXiv digest. The agent judges relevance itself — no API keys needed.

yang3kc/daily_arxiv_digest · 66 tokens

pubmed-research-chronicle

Persistent, versioned research evolution with buildresearchchronicle. Triggers: 研究脈絡, 研究演變, 研究編年史, research chronicle, 領域怎麼演進, 上次之後有什麼新的, 追蹤主題, 里程碑, milestone, timeline, 主題比較.

u9401066/rootcause-mcp · 82 tokens

cv-opencv

Computer vision on images + video with OpenCV (docs.opencv.org/4.x/): core (Mat / ndarray, linalg), imgproc (filtering, morphology, geometric transforms, color conv, histograms, contours), imgcodecs (imread/imwrite — PNG, JPEG, TIFF, WebP, EXR), videoio (VideoCapture / VideoWriter — FFMPEG, GStreamer, V4L2…

damionrashford/media-os · 303 tokens

training-plan

Create personalized training plans for 5K, 10K, Half Marathon, and Marathon races. Use when the user requests a training plan for any of these distances, wants to prepare for a race, or asks for a structured running program. This skill generates comprehensive markdown training plans that include race goals, training…

ColinEberhardt/claude-running-coach · 78 tokens

certificate-audited-analysis

Treat every computed result as unverified until its certificate checks out, review what was omitted rather than only what was included, and digest-chain every published number back to a retained computation. Use when citing any compiled or pipeline output in a document, when reviewing an analysis that publishes…

AURORA-NEURO/aurora-agent · 85 tokens

discriminating-experiment-design

Recognize when a benchmark cannot discriminate between methods, construct experiment families that could, sweep structural knobs without sweeping the decision itself, and report a tie that survives as the headline result. Use when all methods score the same on your benchmark, when designing a new evaluation world or…

AURORA-NEURO/aurora-agent · 89 tokens