When are static real-time scheduling algorithms more appropriate than dynamic real- time scheduling algorithms?
What will be an ideal response?
Static real-time scheduling algorithms are more appropriate in systems that do not provide preemption hardware. They are also simpler to prove correct, meaning that they are more appropriate when a system must be proven to meet all of its deadlines. Dynamic real- time scheduling algorithms are more appropriate when process priorities change over time. The overhead incurred by such algorithms is justified when the level of service provided to such processes meets changing deadlines.
You might also like to view...
________ is the Word feature that automatically creates a backup version of the current document
A) AutoRecover B) AutoSave C) System Backup D) System Restore
The second step in the problem-solving process is to plan the ____, which is the set of instructions that, when followed, will transform the problem's input into its output.
A. program B. algorithm C. instructions D. statements
Which of the following is one of the four “definitive answers” for usability questions that the author offers:
a. Use a large photo on each page. b. Never wear white after Labor Day. c. Don’t use small, low-contrast type.
A theme is a collection of related images and sounds stored in the Gallery
Indicate whether the statement is true or false