Skip to main content

First-come, First-served Scheduling-computer world

 First-come, First-served Scheduling

In this scheduling algorithm simply the jobs according to their arrival time which job come first in the queue will get the CPU first. It means the process(job) that requests the CPU first is allocate the CPU first. The FCFS policy is simply and easily managed with a FIFO(First in First out) queue. When a process enter in the ready, its PCB is linked onto the tail of the queue. When the CPU is free, it allocated to the process at the head if the queue. The code for FCFS scheduling is very simple to understand. On the negative side, the average waiting time under the FCFS policy is long. The CPU has been allocated to a process, that process keeps CPU its processing is not complete. So the CPU in this scheme is scheduled to the process in the order of arrival at the ready queue it is the simplest CPU scheduling algorithm. 

1. Turn around time :

Turn around time is the time taken by a process between ready queue and finishing execution.

2. Wait time : 

Wait time is the time when a process wait before it's start execution.

3. Burst time: 

Burst time is that time which is taken by a process for its execution on the CPU.

Process P1, P2, P3 it's burst time is in the order 24, 3, 3

If the processes arrive in the order P1, P2, P3 and served in FCFS order. The waiting time for P1 is 0 millisecond, 24 millisecond for process P2, 27 millisecond for process P3. Thus the average waiting time is (0+24+27)/3=17 milliseconds.


Comments

Post a Comment

Popular posts from this blog

Single partition allocation, Multiple-partition allocation and Fixed Equal-size partitions in operating system-computer world

  Single partition allocation, Multiple-partition allocation and Fixed Equal-size partitions in operating system Single partition allocation In this scheme operating system is residing in law memory and user process are executing in higher memory. Advantages It is simple  It is easy to understand and use Disadvantages User job is limited to the size of available memory. It leads to poor Utilization of processor and memory. Multiple-partition allocation  It is the simplest method for allocating  memory is divided memory into several fixed size partitions. Fixed Equal-size partitions It divides the main memory Into equal number of fixed sized partitions, operating system occupies some fixed portion and remaining portion of main memory is available for user processes. Advantages It supports multi programming. A process whose size is less then or equal to the partitions size can be loaded into any available partition. Disadvantages If a program is big to fit in...
Post a Comment
Read more

Difference between HTML and DHTML-computer world

     Difference between HTML and DHTML  HTML is a markup language, while DHTML is a collection of Technology.  DHTML creates dynamic web page, whereas HTML create static web page.  DHTML allow including small animations and dynamic menus in web pages but HTML is not able to do so.   HTML used events, methods, properties to insulate dynamism in HTML pages.   HTML is used to describe the web page but DHTML is a collection of JavaScript and style sheet in an HTML page. HTML sites will be show upon client side Technologies, while  DHTML site will be fast enough upon client side Technologies as most of entries are checked on browser itself and not waste time rendering to server for mistake.  HTML creates a plain web page without any style and scripts called as HTML. Whereas,  DHTML creates a page with HTML, CSS,DOM And scripts called as DHTML.  HTML cannot any server side code but XHTML may contain server side code.  ...
Post a Comment
Read more

Distributed transaction model-oocomputerworld

  Distributed transaction model Distributed transaction model:- To access the various data items in a distributed system is usually e accomplished through transaction there are two type of transaction that we need to consider The local transaction The Global transaction    The local transaction:- The local transaction are those that access and update data is only one local database.  The global transaction:- global transaction are those that access and update data in several local database in the case of global transaction the task is more complicated since several nodes may be participating in execution the failure of a communication link connecting these nodes may result in erroneous computation.  System structure :- Each node has its oven local transaction manager whose function is to ensure those transaction that execute at that site. The various transaction manager corporate to execute global transaction. To understand how such a manager can be impl...
Post a Comment
Read more