Question 1

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

Accepted Answer

The answer of The _________ approach is the opposite of...

Question 2

An operating system is __________ to the extent that it performs operations at fixed, predetermined times or within predetermined time intervals.

Accepted Answer

The answer of An operating system is __________ to the...

Question 3

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.

Accepted Answer

The answer of A good way of characterizing multiprocessors and...

Question 4

With the __________ approach the number of threads in a process can be altered during the course of execution.
A) dynamic scheduling
B) load sharing
C) gang scheduling
D) dedicated processor assignment

Accepted Answer

With dynamic scheduling technique, the number of threads in a process can be altered during the course of execution based on the workload and system resources available. Load sharing ensures that work is distributed evenly among all available threads, gang scheduling is a technique in which a group of processes is scheduled to run simultaneously on different processors, and dedicated processor assignment assigns a specific processor to a particular process or thread. However, none of these techniques allow for dynamic alteration of the number of threads in a process. Therefore, option A is the correct answer.

Question 5

In a __________ architecture, the kernel can execute on any processor, and each processor does self-scheduling from the pool of available processes.

Accepted Answer

The answer of In a __________ architecture, the kernel can...

Question 6

Processes at _________ priority levels are guaranteed to be selected to run before any time-sharing process but must defer to real-time processes.
A) kernel
B) time-shared
C) real time
D) load sharing

Accepted Answer

Kernel priority levels are higher than those of time-sharing processes, ensuring they are selected to run before time-sharing processes but still defer to real-time processes, which have the highest priority.

Question 7

__________ is the time required to execute the task to completion.
A) Processing time
B) Priority
C) Resource requirements
D) Ready time

Accepted Answer

Processing time is the time required to execute the task to completion. Priority is the level of importance assigned to a task, resource requirements refer to the materials, equipment or personnel needed to complete a task and ready time is the time at which a task is available to be executed. Of all these options, processing time is the only one that specifically refers to the duration of the task itself.

Question 8

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

Accepted Answer

The answer of An _________ has a deadline by which...

Question 9

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) dynamic scheduling
B) load sharing
C) gang scheduling
D) dedicated processor assignment

Accepted Answer

Gang scheduling is the approach that schedules a group of related threads to run on a set of processors simultaneously, on a one-to-one basis. This approach is used when synchronization and communication are required between the threads, and it ensures that the set of threads runs together as a gang, leading to better efficiency and improved performance. Dynamic scheduling involves the ability to change the order of execution of threads based on the availability of resources, load sharing involves sharing the workload among multiple processors, and dedicated processor assignment involves dedicating a specific processor to a specific task or thread. None of these approaches involve running a set of related threads on a one-to-one basis simultaneously.

Question 10

_________ 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.

Accepted Answer

The answer of _________ is a characteristic that refers to...

Question 11

__________ is the lowest-priority process, intended for user applications other than real-time applications.
A) Kernel
B) Variable priority
C) Real time
D) Time-shared

Accepted Answer

The lowest-priority process, intended for user applications other than real-time applications, is the time-shared process. This is because time-sharing operating systems prioritize processes based on their needs and requirements, and non-real-time user applications do not require immediate or constant attention from the operating system. The kernel is a central part of the operating system that manages system resources and provides services, but it is not a specific process or priority level. Variable priority and real-time processes refer to specific types of processes with different priority levels based on their specific needs, so they are not the lowest-priority process by default.

Question 12

__________ 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.
A) Static priority-driven preemptive approaches
B) Static table-driven approaches
C) Dynamic planning-based approaches
D) Dynamic best effort approaches

Accepted Answer

Static table-driven approaches perform static analysis of feasible schedules and generate a schedule that determines when tasks must begin execution based on a pre-determined set of rules stored in a table. This approach is commonly used in real-time systems where predictability is important.

Question 13

In the __________ approach, a priority is associated with each resource.
A) priority ceiling
B) unbounded priority inversion
C) priority inversion
D) priority inheritance

Accepted Answer

The answer of In the __________ approach, a priority is...

Question 14

__________ 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.

Accepted Answer

The answer of __________ is useful for medium-grained to fine-grained...

Question 15

The __________ class is intended for application that will only consume processor time when no other threads are ready to execute.
A) idle user
B) time-sharing
C) bottom-half kernel
D) real-time

Accepted Answer

The idle user class is designed for applications that do not need to be executed immediately and can wait until there are no other threads that can be executed on the processor. This class ensures that other more important threads get priority over idle threads.

Question 16

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

Accepted Answer

The answer of No feasibility analysis is performed with __________...

Question 17

__________ 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.

Accepted Answer

The answer of __________ computing is defined as that type...

Question 18

The basic idea of _________ is that a lower-priority task inherits the priority of any higher-priority task pending on a resource they share.
A) priority ceiling
B) priority inversion
C) unbounded priority inversion
D) priority inheritance

Accepted Answer

The basic idea of priority inheritance is that a lower-priority task inherits the priority of any higher-priority task pending on a resource they share. This helps to avoid priority inversion and ensure that resources are efficiently used.

Question 19

Linux uses _________ , in which threads are moved for a queue for one processor to a queue for another processor.

Accepted Answer

The answer of Linux uses _________ , in which threads...

Question 20

A _________ has an associated deadline that is desirable but not mandatory.
A) hard real-time task
B) periodic task
C) soft real-time task
D) aperiodic task

Accepted Answer

A soft real-time task has an associated deadline that is desirable but not mandatory. A hard real-time task has a mandatory deadline, a periodic task has a deadline that occurs at regular intervals, and an aperiodic task has no predetermined deadline.

Quiz 10: Multiprocessor and Real-Time Scheduling

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

An operating system is __________ to the extent that it performs operations at fixed, predetermined times or within predetermined time intervals.

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.

With the __________ approach the number of threads in a process can be altered during the course of execution.

In a __________ architecture, the kernel can execute on any processor, and each processor does self-scheduling from the pool of available processes.

Processes at _________ priority levels are guaranteed to be selected to run before any time-sharing process but must defer to real-time processes.

__________ is the time required to execute the task to completion.

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

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.

_________ 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.

__________ is the lowest-priority process, intended for user applications other than real-time applications.

__________ 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.

In the __________ approach, a priority is associated with each resource.

__________ 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 __________ class is intended for application that will only consume processor time when no other threads are ready to execute.

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

__________ 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.

The basic idea of _________ is that a lower-priority task inherits the priority of any higher-priority task pending on a resource they share.

Linux uses _________ , in which threads are moved for a queue for one processor to a queue for another processor.

A _________ has an associated deadline that is desirable but not mandatory.