WorksheetsQuiz Plat
Total questions: 22
Worksheet time: 4mins
A unique value that identifies a thread when it calls a server
Thread context
Alert status
Thread ID
Thread State.
These resources can be used by only one process at a time and are not depleted by usage.
Consumable resources
Deadlock
Reusable resources
Hold and wait
provides programmers with an application programming interface (API) for creating and managing threads.
Thread State
Thread
Thread Synchronization
Thread Library
This happens whenever a thread completes its entire execution. Its register settings and stacks are deallocated.
Finish
Block
Spawn
Unblocked
A closed chain of threads exists, such that each thread holds at least one resource needed by the next thread in the chain.
Mutual exclusion
Hold and wait:
No preemption
Circular wait
can be defined as permanent blocking of a set of processes that either compete for system resources or communicate with each other.
Deadlock
Hold and wait
circular wait
Thread
pertains to the ability of an operating system (OS) to support multiple, concurrent paths of execution within a single process. T
resource allocation graph
Multithreading
Kernel-Level Threads
Thread
The benefit of multithreading is greater when dealing with multiprocessor architecture, where threads can run in parallel on different processing cores.
Responsiveness
Economical
Scalability
Resource Sharing :
This strategy does not limit resource access or restricts process executions. Requested resources are granted to processes whenever possible. Then, the operating system periodically executes an algorithm that detects the presence of a circular wait condition.
Deadlock Detection
Deadlock Avoidance
Deadlock Prevention
Deadlock
The thread's execution priority at any given moment
Thread ID
Dynamic priority
Alert status
Base priority
– Each thread of execution is a unique process with its own address space and resources.
Multiple processes: Multiple threads per processes (M:M)
One process: Multiple threads (1:M)
One process: One thread (1:1)
Multiple processes: One thread per process (M:1)
the key states for a thread are Running, Ready, and Blocked. If a process is swapped out, noted that all of its threads are automatically swapped out because they all share the address space of the process
Thread State
Thread
Thread Library
Thread Synchronization
Resources cannot be preempted. This means that a resource can only be released voluntarily by the thread holding it after that thread has completed its task.
Mutual exclusion
Hold and wait
Circular wait
No preemption
This happens when a thread needs to wait for a particular event. In this operation, all the necessary information are automatically saved for the thread's execution resumption
Spawn
Block
Finish
Unblocked
A thread is a fundamental element of CPU utilization. Which of the following is NOT a typical thread attribute?
Thread execution state
Saved thread context
Execution stack
Virtual Memory Paging File
Which operation resumes a blocked thread and moves it to the ready queue?
Spawn
Unblock
Finish
Block
The ability of an OS to support multiple concurrent paths of execution within a process is called:
Multithreading
Multiprocessing
Multiprogramming
Multitasking
Which benefit of multithreading refers to threads sharing memory and resources of a process?
Responsiveness
Economical
Scalability
Resource Sharing
Which benefit of multithreading is maximized on multiprocessor systems?
Scalability
Responsiveness
Economical
Resource Sharing
If a thread is waiting for an event, which state is it in?
Terminated
Blocked
Ready
Running
Which thread management approach is invisible to the kernel?
User-level threads
Kernel-level threads
Multithreaded processes
Combined approach
Which of the following is an example of a multithreaded application?
A typewriter
BIOS firmware
A single-task calculator
A photo viewer creating thumbnails
