Feb 11 · 6 min read · Truths About CPU Scheduling In the few milliseconds it takes you to scroll down this page, your computer has made hundreds of executive decisions. To the user, a modern operating system feels like a seamless, multitasking powerhouse—a digital ocean o...
Join discussion
Oct 11, 2025 · 4 min read · FCFS Algorithm — First Come, First Served When multiple processes are waiting to use the CPU, how should the OS decide who goes first?That’s where CPU scheduling comes into play — and the simplest algorithm among them is FCFS (First Come, First Serve...
Join discussionSep 5, 2024 · 27 min read · In the previous article, we learned the basics of how Operating Systems manage program execution and that the CPU must switch between processes to schedule one to run. In this article, we will explore in more detail how this scheduler works. Underst...
Join discussion
Jan 18, 2024 · 11 min read · Using an example, let's illustrate how First-Come, First-Served (FCFS) process scheduling works in an operating system. We'll consider four processes, P1 to P4, each with its own arrival and burst times. We will then calculate the response, waiting, ...
Join discussionJan 18, 2024 · 3 min read · FCFS P1: Arrival Time = 2, Burst Time = 6 P2: Arrival Time = 5, Burst Time = 2 P3: Arrival Time = 1, Burst Time = 8 P4: Arrival Time = 0, Burst Time = 3 P5: Arrival Time = 4, Burst Time = 4 Determine the order of completion, and calculate the average...
Join discussion