Q. Some of the properties of real time systems include :

View solution

Q. The amount of memory in a real time system is generally :

View solution

Q. The priority of a real time task :

View solution

Q. Memory management units :

View solution

Q. The technique in which the CPU generates physical addresses directly is known as :

View solution

Q. Earliest deadline first algorithm assigns priorities according to :

View solution

Q. A process P1 has a period of 50 and a CPU burst of t1 = 25, P2 has a period of 80 and a CPU burst of 35. The total CPU utilization is :

View solution

Q. Using EDF algorithm practically, it is impossible to achieve 100 percent utilization due to :

View solution

Q. T shares of time are allocated among all processes out of N shares in __________ scheduling algorithm.

View solution

Q. If there are a total of T = 100 shares to be divided among three processes, A, B and C. A is assigned 50 shares, B is assigned 15 shares and C is assigned 20 shares. A will have ______ percent of the total processor time.

View solution

Q. If there are a total of T = 100 shares to be divided among three processes, A, B and C. A is assigned 50 shares, B is assigned 15 shares and C is assigned 20 shares. B will have ______ percent of the total processor time.

View solution

Q. If there are a total of T = 100 shares to be divided among three processes, A, B and C. A is assigned 50 shares, B is assigned 15 shares and C is assigned 20 shares. C will have ______ percent of the total processor time.

View solution

Q. If there are a total of T = 100 shares to be divided among three processes, A, B and C. A is assigned 50 shares, B is assigned 15 shares and C is assigned 20 shares. If a new process D requested 30 shares, the admission controller would :

View solution

Q. To schedule the processes, they are considered _________

View solution

Q. If the period of a process is ‘p’, then the rate of the task is :

View solution

Q. The scheduler admits a process using :

View solution

Q. The ____________ scheduling algorithm schedules periodic tasks using a static priority policy with preemption.

View solution

Q. Rate monotonic scheduling assumes that the :

View solution

Q. In rate monotonic scheduling, a process with a shorter period is assigned :

View solution

Q. There are two processes P1 and P2, whose periods are 50 and 100 respectively. P1 is assigned higher priority than P2. The processing times are t1 = 20 for P1 and t2 = 35 for P2. Is it possible to schedule these tasks so that each meets its deadline using Rate monotonic scheduling ?

View solution