Planlama (Scheduling)
CPU'da hangi sürecin çalışacağını belirleyen OS mekanizması.
Scheduling is a core OS function that allocates the limited CPU resource among competing processes. Schedulers aim to maximize CPU utilization, ensure fairness, and minimize response time. Common algorithms include Round Robin, First-Come-First-Served, and Priority Scheduling.
graph LR
Center["Planlama (Scheduling)"]:::main
Rel_incident_response["incident-response"]:::related -.-> Center
click Rel_incident_response "/terms/incident-response"
classDef main fill:#7c3aed,stroke:#8b5cf6,stroke-width:2px,color:white,font-weight:bold,rx:5,ry:5;
classDef pre fill:#0f172a,stroke:#3b82f6,color:#94a3b8,rx:5,ry:5;
classDef child fill:#0f172a,stroke:#10b981,color:#94a3b8,rx:5,ry:5;
classDef related fill:#0f172a,stroke:#8b5cf6,stroke-dasharray: 5 5,color:#94a3b8,rx:5,ry:5;
linkStyle default stroke:#4b5563,stroke-width:2px;
🧒 5 yaşındaki gibi açıkla
Mutfaktaki meşgul bir şefi düşünün. Farklı yemekler için 10 siparişi var. Hangi bifteğin önce ızgaraya gireceğine ve salataya ne zaman başlayacağına karar vermesi gerekir ki her şey zamanında hazır olsun. Planlama, bir sonraki işlemciyi kimin kullanacağına karar veren 'beyindir'.
🤓 Expert Deep Dive
Preemptive scheduling allows the OS to forcibly interrupt a running process to give another one a turn. Multi-level feedback queues (MLFQ) dynamically adjust process priorities based on their behavior (I/O bound vs CPU bound) to optimize both throughput and interactivity.