This is a C program to simulate First come first served (FCFS) CPU scheduling algorithm. First come first served algorithm serves each processes (or jobs) in the order of arrival. The process with lowest arrival time is executed first.
Program:
#include<stdio.h>
struct process
{
int burst,wait;
}p[20]={0,0};
Information about resetting and configuring Mobile phones (Java, Android, Symbian etc), educational articles especially for programming in C, C++ and Java and more about Computers and operating systems
Showing posts with label served. Show all posts
Showing posts with label served. Show all posts
Simulation of FCFS CPU Scheduling Algorithm in C
Labels:
$ccpp
,
average
,
c program
,
CPU
,
FCFS
,
first come
,
first serve
,
lab
,
operating Systems
,
OS lab
,
scheduling algorithm
,
served
,
simulate
,
simulation
,
turn around time
,
wait time
Subscribe to:
Posts
(
Atom
)