cpu schedule Flashcards
(14 cards)
what dose it means Process scheduling
means choosing which program (process) should run on the CPU next.
Stopping the current running process,
✅ Picking another process to run,
✅ Based on a certain rule or plan (called a strategy). the above thing is done by …..?
process manager
guess which dose the follwing things It is a program inside the operating system.
Job: Chooses which process should run next on the CPU.
Think of it like a decision-maker or a selector.
🧠 Scheduler
The number of processes or tasks the CPU finishes in a certain amount of time. is called …….
Throughput
tell me all Process Scheduling Objectives one by one
Allow more users with fast responses.
Balance between speed (response time) and efficiency (CPU usage).
Be fair – don’t let any process wait forever, and follow priorities.
Give first chance to processes using important resources. Keep the CPU busy and finish more work in less time (high CPU utilization and throughput).
Throughput: The amount of work done in a certain time.
what dose it means preemptive Scheduling means
Preemptive Scheduling is when the CPU can interrupt a running process and give the CPU to another process, like if time runs out or a more important process arrives
give example 3 example of an algorithm that using preemptive scheduling
Round Robin (RR)
🕒 Also called: Time-Slicing Scheduling
Shortest Remaining Time First (SRTF)
🧮 Also called: Preemptive version of Shortest Job First (SJF)
Priority Scheduling (Preemptive)
🎯 Also called: Preemptive Priority Scheduling
hey preemptive schedule is haping form which to which state the are two state is there rember two of them
Running ➡️ Ready
Waiting ➡️ Ready
what dose it means
Non preemptive scheduling
Non-Preemptive Scheduling means once a process gets the CPU, it keeps it until it finishes or goes to waiting.
🌟 No one can interrupt it — not even if a more important process arrives.
🧠 Summary of Non-Preemptive Scheduling:
Once a process starts, it won’t be interrupted.
It continues until it finishes or needs to wait.
Non preemptive schedule is used when
process terminates
running to waiting state.
give me the example of algorithm that used Non preemptive scchedule
SJF(short job first)
non-preemptive(prioity)
what dose it means brust time
When a process (like P1) goes to the CPU, the time the CPU takes to execute that process is called burst time. Burst time is the total time the CPU takes to execute a process. It’s the time the CPU spends working on that process (doing calculations, processing data, etc.) until the process is finished.
what dose it mena Arrival time
Arrival time malet exactly yehon process meto ready queue lay mekemtebeten exact time nw ready queue lay kemeta buhal k CPU atention eskietew ders metebekew sat arrival time aydelem just arrival time malt yehon process lemjemrya geze ready queue lay yemetabet time nw lemsale yehon process lek 2 dekiia sele ready queue lay keders or kemeta arriaval time weyem yedersetebt time 2 dekika nw malt nw Let’s say a process P1 arrives at the ready queue at time 5:
Arrival Time = 5: This is when P1 enters the ready queue and is ready to be processed by the
CPU.Arrival time is the exact moment a process enters the ready queue, not the time it waits for the CPU or starts execution
what dose it means exit time
It’s the time when the process is completely done and has finished using the CPU or CPU no longer needs to work on it. aaaa exit time malt yehon process zelalemun eytesera aykoyem yehon sat teserto yabekal teserto kabeka buhal CPU nnn leko yewetal yanen time nw exit time menelw alke kelal nw
