Exam 10: Multiprocessor and Real-Time Scheduling
Exam 1: Computer Systems Overview45 Questions
Exam 2: Operating System Overview45 Questions
Exam 3: Process Description and Control45 Questions
Exam 4: Threads45 Questions
Exam 5: Concurrency: Mutual Exclusion and Synchronization45 Questions
Exam 6: Concurrency: Deadlock and Starvation45 Questions
Exam 7: Memory Management45 Questions
Exam 8: Virtual Memory45 Questions
Exam 9: Uniprocessor Scheduling45 Questions
Exam 10: Multiprocessor and Real-Time Scheduling45 Questions
Exam 11: Io Management and Disk Scheduling45 Questions
Exam 12: File Management45 Questions
Exam 13: Embedded Operating Systems45 Questions
Exam 14: Computer Security Threats45 Questions
Exam 15: Computer Security Techniques45 Questions
Exam 16: Distributed Processing, Clientserver, and Clusters45 Questions
Exam 17: Network Protocols45 Questions
Exam 18: Distributed Process Management45 Questions
Select questions type
With the __________ approach the number of threads in a process can be altered during the course of execution.
Free
(Multiple Choice)
4.9/5
(35)
Correct Answer:
A
The __________ class is intended for application that will only consume processor time when no other threads are ready to execute.
Free
(Multiple Choice)
4.8/5
(36)
Correct Answer:
A
Linux uses _________ , in which threads are moved for a queue for one processor to a queue for another processor.
Free
(Short Answer)
4.8/5
(44)
Correct Answer:
dynamic load balancing
For __________ scheduling, the highest-priority task is the one with the shortest period, the second highest-priority task is the one with the second shortest period, and so on.
(Short Answer)
4.8/5
(32)
Processes at _________ priority levels are guaranteed to be selected to run before any kernel or time-sharing process.
(Short Answer)
4.7/5
(41)
The basic idea of _________ is that a lower-priority task inherits the priority of any higher-priority task pending on a resource they share.
(Multiple Choice)
4.9/5
(36)
In the __________ approach, a priority is associated with each resource.
(Multiple Choice)
4.9/5
(30)
__________ computing is defined as that type of computing in which the correctness of the system depends not only on the logical result of the computation but also on the time at which the results are produced.
(Short Answer)
4.8/5
(33)
Because of the potential disadvantages, load sharing is not one of the commonly used schemes in current multiprocessors.
(True/False)
4.9/5
(37)
Static table-driven scheduling is applicable to tasks that are periodic.
(True/False)
4.8/5
(34)
__________ is the lowest-priority process, intended for user applications other than real-time applications.
(Multiple Choice)
4.8/5
(25)
__________ is the time required to execute the task to completion.
(Multiple Choice)
4.9/5
(38)
A _________ has an associated deadline that is desirable but not mandatory.
(Multiple Choice)
4.8/5
(44)
__________ occurs when circumstances within the system force a higher-priority task to wait for a lower-priority task.
(Short Answer)
4.9/5
(42)
User control is generally much broader in an ordinary operating system than in a real-time operating system.
(True/False)
5.0/5
(39)
With coarse and __________ grained parallelism, there is synchronization among processes, but at a very gross level.
(Multiple Choice)
4.8/5
(47)
With independent parallelism there is an explicit synchronization among processes.
(True/False)
4.8/5
(38)
A loosely coupled or distributed multiprocessor consists of a collection of relatively autonomous systems, with each processor having its own main memory and I/O channels.
(True/False)
4.9/5
(36)
Typically, there will need to be rather a high degree of coordination and interaction among the threads of an application, leading to a __________ level of synchronization.
(Multiple Choice)
4.9/5
(35)
Showing 1 - 20 of 45
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)