|
INTERVIEW QUESTIONS
PROGRAMMING LANGUAGES
WINDOWS PROGRAMING
DETAILS
Question: Compare Linux credit based algorithm with other scheduling algorithms?
Answer: For the conventional time ?shared processes, Linux uses a prioritized, credit-based algorithm. Each process possesses a certain number of scheduling credits; when a new task must be chosen to run, the process with most credits is selected. Every time that a timer interrupt occurs, the currently running process loses one credit; when its credits reaches zero, it is suspended and another process is chosen. If no runnable processes have any credits, then Linux performs a recrediting operation, adding credits to every process in the system (rather than just to the runnable ones), according to the following rule: Credits = credits/2 + priority The above scheduling class is used for time-shared process and the in Linux for the real-time scheduling is simpler it uses scheduling classes: first come, first served (FCFS), and round-robin (RR) .In both cases, each process has a priority in addition to its scheduling class. In time-sharing scheduling, however, processes of different priorities can still compete with one another to some extent; in real-time scheduling, the scheduler always runs the process with the highest priority. Among processes of equal priority, it runs the process that has been waiting longest. The only difference between FCFS and RR scheduling is that FCFS processes continue to run until they either exit or block, whereas a round-robin process will be preempted after a while and will be moved to the end of the scheduling queue.
|
|
|
Category |
Windows Programing Interview Questions & Answers -
Exam Mode /
Learning Mode
|
Rating |
(0.2) By 8927 users |
Added on |
9/22/2014 |
Views |
71429 |
Rate it! |
|
|
Question:
Compare Linux credit based algorithm with other scheduling algorithms?
Answer:
For the conventional time ?shared processes, Linux uses a prioritized, credit-based algorithm. Each process possesses a certain number of scheduling credits; when a new task must be chosen to run, the process with most credits is selected. Every time that a timer interrupt occurs, the currently running process loses one credit; when its credits reaches zero, it is suspended and another process is chosen. If no runnable processes have any credits, then Linux performs a recrediting operation, adding credits to every process in the system (rather than just to the runnable ones), according to the following rule: Credits = credits/2 + priority The above scheduling class is used for time-shared process and the in Linux for the real-time scheduling is simpler it uses scheduling classes: first come, first served (FCFS), and round-robin (RR) .In both cases, each process has a priority in addition to its scheduling class. In time-sharing scheduling, however, processes of different priorities can still compete with one another to some extent; in real-time scheduling, the scheduler always runs the process with the highest priority. Among processes of equal priority, it runs the process that has been waiting longest. The only difference between FCFS and RR scheduling is that FCFS processes continue to run until they either exit or block, whereas a round-robin process will be preempted after a while and will be moved to the end of the scheduling queue. Source: CoolInterview.com
If you have the better answer, then send it to us. We will display your answer after the approval.
Rules to Post Answers in CoolInterview.com:-
- There should not be any Spelling Mistakes.
- There should not be any Gramatical Errors.
- Answers must not contain any bad words.
- Answers should not be the repeat of same answer, already approved.
- Answer should be complete in itself.
|
|
Related Questions |
View Answer |
|
Condition for deadlock occurrence?
|
View Answer
|
|
What is the relation between process system time, process waiting time , and process CPU time?
|
View Answer
|
|
Differentiate between Compiler and Interpreter?
|
View Answer
|
|
Explain the difference between microkernel and macro kernel?
|
View Answer
|
|
What is a Safe State and its use in deadlock avoidance?
|
View Answer
|
|
Why paging is used?
|
View Answer
|
|
Binding of Instructions and Data to Memory?
|
View Answer
|
|
Differentiate between RAM and ROM?
|
View Answer
|
|
What is multi tasking, multi programming, multi threading?
|
View Answer
|
|
Recovery from Deadlock?
|
View Answer
|
|
What is Semaphore?
|
View Answer
|
|
How does Windows NT supports Multitasking?
|
View Answer
|
|
Explain the working of Virtual Memory?
|
View Answer
|
|
What is INODE?
|
View Answer
|
|
What is the difference between a computer process and thread?
|
View Answer
|
|
What is MUTEX?
|
View Answer
|
|
Name the AD NCs and replication issues for each NC?
|
View Answer
|
|
What are administrative templates?
|
View Answer
|
|
What are GPO links? What special things can I do to them?
|
View Answer
|
|
What are the GPC and the GPT? Where can I find them?
|
View Answer
|
Please Note: We keep on updating better answers to this site. In case you are looking for Jobs, Pls Click Here Vyoms.com - Best Freshers & Experienced Jobs Website.
View All Windows Programing Interview Questions & Answers - Exam Mode /
Learning Mode
|