only options required no need of explination

Chapter 10 Multiprocesso and Real-Time Scheduling IRLEMEALSE QUESTIONS: T F A loosely coupled or distributed multiprocessor consists of a collection of relatively autonomous systems, with each processor having its own main memory and channels. T 2) With independent parallelism there is an explicit synchronization among processes. T 3)Atypical use of independent parallelism is in a tim sharing system. T 4) A disadvantage of static assignment is that one processor can be idle, with an empty queue, while another processor has a backlog. T 5) In most traditional multiprocessor systems process are dedicated to processors. F 6) An application can be implemented as a set of threads, which cooperate and execute concurrently in the same address space. T 7) Because of the potential disadvantages, load sharin is not one of the commonly used schemes in current multiprocessors T 8) The operating system, and in particular the scheduler, is perhaps the most important component of a real-time system. T 9 One useful measure of the ability of an operating system to function deterministically is the maximum delay from the arrival of a high- priority device interrupt to when servicing begins. T F 0) User control is generally much broader in an ordinary operating system than in a real-time operating system. )Static table-driven scheduling is applicable to tasl that are periodic. T 2) One of the more promising methods of resolving multitask scheduling conflicts for periodic tasks is rate monotonic scheduling. T 13 Real-time tasks are not handled any differently than non-real-time tasks in the priority queues. T F 4) Linux provided a real-time scheduling capability coupled with a scheduler for non-real-time processes that made use of the traditional UNIX scheduling algorith T 5)In the real-time-priority class, all threads have a fixed priority that never changes and all of the active threads at a given priority level are