Exam 10: Multiprocessor and Real-Time Scheduling

__________ is the time at which task becomes ready for execution.

No feasibility analysis is performed with __________ approache, and the system tries to meet all deadlines and aborts any started process whose deadline is missed.

An application can be implemented as a set of threads, which cooperate and execute concurrently in the same address space.

The multiprocessor system which consists of a set or processors that share a common main memory and are under the integrated control of an operating system is a _________ .

Real-time tasks are not handled any differently than non-real-time tasks in the priority queues.

The __________ approach is a set of related threads scheduled to run on a set of processors at the same time, on a one-to-one basis.

A typical use of independent parallelism is in a time-sharing system.

_________ is a characteristic that refers to the ability of a system to fail in such a way s to preserve as much capability and data as possible.

A good way of characterizing multiprocessors and placing them in context with other architectures is to consider the synchronization __________ , or frequency of synchronization, between processes in a system.

A __________ is one that must meet its deadline, otherwise it will cause unacceptable damage or a fatal error to the system.

__________ is useful for medium-grained to fine-grained parallel applications whose performance severely degrades when any part of the application is not running while other parts are ready to run.

The operating system, and in particular the scheduler, is perhaps the most important component of a real-time system.

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.

An _________ has a deadline by which it must finish or start, or it may have a constraint on both start and finish time.

In most traditional multiprocessor systems processes are dedicated to processors.

Linux provided a real-time scheduling capability coupled with a scheduler for non-real-time processes that made use of the traditional UNIX scheduling algorithm.

One of the more promising methods of resolving multitask scheduling conflicts for periodic tasks is rate monotonic scheduling.

A thread is considered to be _________ if the ratio of its voluntary sleep time versus its runtime is below a certain threshold.

The _________ approach is the opposite of the load-sharing approach and provides implicit scheduling defined by the assignment of threads to processors.

__________ perform static analysis of feasible schedules of dispatching with the result of the analysis being a schedule that determines, at run time, when a task must begin execution.