term1 Definition1term2 Definition2term3 Definition3
Please sign in to your Google account to access your documents:
RMA is optimal for scheduling access of several hard real‐timeperiodic tasks to a certain shared critical resource.
FALSE. RMA schedulers impose no constraints on the orders in whichvarious tasks execute. Therefore, the schedules produced by RMA mightviolate the constraints imposed due to task dependencies
Unless a suitable resource‐sharing protocol is used, even thelowest priority task in a real‐time system may suffer fromunbounded priority inversions.
FALSE. Unbounded priority inversion occurs when a higher priority taskwaits for a lower priority task to release a resource it needs, and meanwhilethe intermediate priority tasks preempt the lower priority task from CPUusage repeatedly
Scheduling a set of real‐time tasks for access to a set of non‐preemptable resources using PIP results in unbounded priorityinversions for tasks
FALSE. PIP allows real‐time tasks share critical resources without lettingthem incur unbounded priority inversions.
A task can undergo priority inversion for some duration under PCPeven if it does not require any resource.
TRUE. Under PCP, inheritance‐related inversion can occur. In suchscenarios, an intermediate priority task not needing a critical resource iskept waiting.
PCP is a efficient protocol to share a set of serially reusablepreemptable resources among a set of real‐time tasks.
FALSE. PCP is not well‐suited for sharing a set of serially reusablepreemptable resources among a set of real‐time tasks. EDF or RMA aremore efficient
A separate queue is maintained for the waiting tasks for eachcritical resource in HLP
FALSE. Unlike PIP, HLP does not maintain a separate queue for each criticalresource. The reason is that whenever a task acquires a resource, itexecutes at the ceiling priority of the resource, and the other tasks thatmay need this resource do not even get a chance to execute and requestfor the resource
HLP overcomes deadlocks while sharing critical resources among aset of real‐time tasks.
TRUE. HLP overcomes the deadlock problem possible with PIP
Under HLP, tasks are single‐blocking
TRUE. When HLP is used for resource sharing, once a task gets a resourcerequired by it, it is not blocked any further. This means that when a taskacquires one resource, all the other resources required by it must be free
Under PCP, the highest priority task does not suffer any inversionswhen sharing certain critical resources.
FALSE. Even under PCP, the highest priority protocol can suffer from directand avoidance‐related inversions.
Under PCP, the lowest priority task does not suffer any inversionswhen sharing certain critical resources
TRUE. In PCP, the lowest priority task does not suffer from any of direct,inheritance‐related, or avoidance‐related inversions.
Need help typing ? See our FAQ (opens in new window)
Please sign in to create this set. We'll bring you back here when you are done.
Discard Changes Sign in
Please sign in to add to folders.
Sign in
Don't have an account? Sign Up »
You have created 2 folders. Please upgrade to Cram Premium to create hundreds of folders!