User talk:Jaddh

Welcome
 Hello Jaddh, and Welcome to Wikipedia!  Welcome to Wikipedia! I hope you enjoy the encyclopedia and want to stay. As a first step, you may wish to read the Introduction.

If you have any questions, feel free to ask me at my talk page – I'm happy to help. Or, you can ask your question at the New contributors' help page.

--- Here are some more resources to help you as you explore and contribute to the world's largest encyclopedia...

Finding your way around:


 * Table of contents


 * Department directory

Need help?


 * Questions – a guide on where to ask questions
 * Cheatsheet – quick reference on Wikipedia's mark-up codes
 * Wikipedia's 5 pillars – an overview of Wikipedia's foundations


 * Article wizard – a Wizard to help you create articles
 * The simplified ruleset – a summary of Wikipedia's most important rules
 * Guide to Wikipedia – a thorough step-by-step guide to Wikipedia

How you can help:


 * Contributing to Wikipedia – a guide on how you can help


 * Community portal – Wikipedia's hub of activity

Additional tips...


 * Please sign your messages on talk pages with four tildes ( ~ ). This will automatically insert your "signature" (your username and a date stamp). The [[File:Button sig.png]] or [[File:Insert-signature.png]] button, on the tool bar above Wikipedia's text editing window, also does this.


 * If you would like to play around with your new Wiki skills the Sandbox is for you.

Jaddh, good luck, and have fun. – Aboutmovies (talk) 08:34, 23 December 2013 (UTC)

Priority Scheduling
In Priority scheduling each process can be associated with a priority. CPU is allocated to the process having the highest priority. Equal Priority processes are considered equal and hence the processes which comes first in the CPU are served(Processes) first according to the FCFS (First Come First Served) Algorithm.

CPU also serves processes which have a short burst time(time taken to processes a task) these tasks are processes first because they require less CPU time. instead of waiting in the CPU queue for a long time when the task requires very small amount of time by the CPU. Hence, larger the CPU burst time lower is the priority and vice versa.

Priorities can be defined either internally or externally. internal definition could be based on memory requirements, number of open files etc. external definition could be based on factors like, time taken by the user to input data, or user affiliated factors, slow user input is considered as 'higher burst time' and the priority of the task is reduced.

Priority based algorithms can be either preemptive(stoppable) or non-Preemptive(not-stoppable). in the case of Preemptive scheduling, if a new process joins the ready queue with a priority higher than the process that is under execution, then the current process is preempted and CPU is allocated to the new process. But in the case of Non-Preemptive Algorithm, the new process having the highest priority from among the ready processes, is allocated to the CPU only after the current process leaves the CPU.

Setting Priority of some Applications to high can make then run faster. however Realtime Priority must be avoided. Realtime priority means that the CPU has limited time to process the task. if the task is processed 1 msecs later or earlier then the time constraint then the computer will crash. advance users should only try this option on Average Quad core CPU's or better. But this option is very dangerous and it should be avoided at any costs.