Which of the scheduling algorithm are based on the assumption that tasks are executed until they are done?(a) periodic task(b) aperiodic task(c) non-preemptive scheduling(d) preemptive schedulingThe question was asked in unit test.The question is from Classification of Scheduling Algorithms topic in division Embedded Operating System, Middleware and Scheduling of Embedded Systems

Which of the scheduling algorithm are based on the assumption that tas

1.	Which of the scheduling algorithm are based on the assumption that tasks are executed until they are done?(a) periodic task(b) aperiodic task(c) non-preemptive scheduling(d) preemptive schedulingThe question was asked in unit test.The question is from Classification of Scheduling Algorithms topic in division Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» The correct answer is (c) non-PREEMPTIVE SCHEDULING Explanation: The nonpreemptive scheduling is based on the assumptions that the tasks are executed until the task is done whereas the preemptive scheduling is USED if the task has long execution times or for a SHORT RESPONSE time.

Discussion

No Comment Found

Related InterviewSolutions

Who proposed the LDF algorithm?(a) Bayes(b) Nyquist(c) Lawler(d) StankovicThis question was posed to me by my college director while I was bunking the class.The question is from Aperiodic Scheduling in portion Embedded Operating System, Middleware and Scheduling of Embedded Systems
Which of the following scheduling test can be used to show that no scheduling exist?(a) sufficient test(b) necessary test(c) complex test(d) simple testThe question was asked in an interview for job.My query is from Classification of Scheduling Algorithms topic in section Embedded Operating System, Middleware and Scheduling of Embedded Systems
Which estimate approach takes more time to consume?(a) accurate value(b) estimated value(c) accurate cost and performance value(d) estimated cost and performance valueThis question was addressed to me in class test.The query is from Prediction of Execution Times topic in chapter Embedded Operating System, Middleware and Scheduling of Embedded Systems
Which of the following is more difficult than the scheduling independent task?(a) scheduling algorithm(b) scheduling independent task(c) scheduling dependent task(d) aperiodic scheduling algorithmThe question was asked in an international level competition.This intriguing question comes from Periodic Scheduling topic in portion Embedded Operating System, Middleware and Scheduling of Embedded Systems
Which algorithm can distinguish homogeneous multiprocessor system and heterogeneous multiprocessor system?(a) complex algorithm(b) simple algorithm(c) scheduler algorithm(d) preemptive algorithmI had been asked this question in semester exam.The question is from Classification of Scheduling Algorithms topic in division Embedded Operating System, Middleware and Scheduling of Embedded Systems
Deadline interval – execution time =(a) laxity(b) execution time(c) deadline interval(d) periodThe question was posed to me during a job interview.Asked question is from Aperiodic Scheduling topic in division Embedded Operating System, Middleware and Scheduling of Embedded Systems
Which of the following systems are entirely controlled by the timer?(a) voltage triggered(b) time triggered(c) aperiodic task scheduler(d) periodic task schedulerThis question was addressed to me in an international level competition.I'd like to ask this question from Classification of Scheduling Algorithms topic in chapter Embedded Operating System, Middleware and Scheduling of Embedded Systems
Which of the following is the base for scheduling algorithm?(a) WCET(b) time(c) execution time(d) address accessing timeI got this question in unit test.Enquiry is from Prediction of Execution Times in portion Embedded Operating System, Middleware and Scheduling of Embedded Systems
For which of the following WCET can be computed?(a) C program(b) assembly language(c) VHDL(d) program without recursionThis question was posed to me in homework.My question is from Prediction of Execution Times topic in division Embedded Operating System, Middleware and Scheduling of Embedded Systems
Which algorithm is dynamic scheduling algorithm?(a) LL(b) LST(c) EDF(d) EDDThe question was posed to me during a job interview.Query is from Aperiodic Scheduling topic in section Embedded Operating System, Middleware and Scheduling of Embedded Systems

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment