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

Aggregation and Functional dependency in DBMS-computer world

  Aggregation and  Functional dependency in  DBMS Aggregation  In aggregation the relation between two entities is treated as a single entity. In aggregation relationship with its corresponding entity is aggregated into higher level entity . It is the process of compiling information on object, there by obstructing a higher level. On limitation of the ER model is that it can not Express relationship among relationships. The aggregation represent a relationship between a whole object and its component in other word we can say that using aggregation we can express relationship main relationships.  For example center entity offer the course entity act as a single entity in the relationship which is in a relationship with another entity visitor. In the real world if a visitor visits a coaching center they will never inquiry about the course or just about the center instead he will ask the inquiry about both. Functional dependency  Functional dependency play an ...
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

Nested relation -oocomputer world

 Nested relation   During the first normal form we require that all attributes have atomic domain a domain is atomic if elements of the domain are considered to be indivisible unit.  For example the set of integer is an atomic domain but the set of all sets of integer is a non atomic domain. We considered set of integer to have subpart the important issue in first normal form not the domain itself but rather the way we use domain element in database. The nested relational model is a extension of the relation model in which domain may be either atomic or relation  valued of a tuple on a attribute may be relation and relation may be stored within relation . A complex objects can be represented by a single tuple of a nested relation if we view a tuple of a nested relation a data item we have a one to one correspondence between data item and objects in the user's view of the database.  Nested relation are just one example of extensions to the basic relational m...
Post a Comment
Read more