Written by students who passed Immediately available after payment Read online or as PDF Wrong document? Swap it for free 4.6 TrustPilot
logo-home
Document preview thumbnail
Preview 3 out of 29 pages
Exam (elaborations)

WGU C191 MODULE 2 Questions & Answers | Latest Update 202

Document preview thumbnail
Preview 3 out of 29 pages

Temporary data such as function parameters, return addresses, and local variables. What does a stack contain? 1. The parent continues to execute concurrently with its children. 2. The parent waits until some or all of its children have terminated. 3. The child process is a duplicate of the parent process (it has the same program and data as the parent). 4. The child process has a new program loaded into it. When a parent creates a child process what are the possibilities?

Content preview

WGU C191 MODULE 2 Questions & Answers | Latest Update 2024 Temporary data such as function parameters, return addresses, and local variables. ✔✔What does a stack contain? 1. The parent continues to execute concurrently with its children. 2. The parent waits until some or al l of its children have terminated. 3. The child process is a duplicate of the parent process (it has the same program and data as the parent). 4. The child process has a new program loaded into it. ✔✔When a parent creates a child process what are the possibili ties? Context Switch ✔✔The kernel saves the context of the old process in its PCB and loads the saved context of the new process scheduled to run Task control block ✔✔What is another name for the PCB (process control block)? Process Scheduling Que ues ✔✔- job queue - all processes in a system -ready queue - all process in main memory ready and waiting to execute -device queues - set of processes waiting for i/o device - penguins play w/ cool arctic melted ice Process state, Program counter, CP U registers, Accounting information, memory -
management info, and I/O status information. ✔✔What does the PCB(info associated with each process) contain? I/O-bound process ✔✔spends more time doing I/O than computations, many short CPU bursts CPU-bound process ✔✔spends more time doing computations; few very long CPU bursts process creation ✔✔- address space -child duplicate of parent -child has a program loaded into it -UNIX examples - fork system creates new process -exec system call used after a for k to replace the process' memory space with a new program Nonpreemtive kernel ✔✔When a process switches from a running state to the waiting state or when a process terminates. Runs until exits kernel mode, blocks, or voluntarily yields CPU. Essentially free of race conditions in kernel mode. Preemptive kernel ✔✔Allows interruption of a process by another process when running in kernel mode Cooperative ✔✔Synonymous with non - preemptive scheduling Dispatcher ✔✔The module that gives control of the CPU to the process selected by the short -
term scheduler Throughput ✔✔The number of processes that are completed per time unit PCS (process -contention scope) ✔✔The scheme by which a many -to-one or many -to-many system schedules user -threads SCS(Sys tem contention scope) ✔✔Decides which kernel level thread to schedule onto a CPU. Process ✔✔A program in execution Thread ✔✔Sometimes used synonymously with process, a single sequence of executing code. It consists of a thread ID, program counter, re gister set, and a stack. Heap ✔✔Memory that is dynamically allocated during a process run time Descriptions of the changes in an executing process ✔✔What is a state? Name the process states. ✔✔New, Running, Waiting, Ready, Terminated. PCB(process control block) ✔✔How an operating system represents a process. Serves as a repository for any info that may vary from process to process. Swapping ✔✔The scheme of moving a process in and out of memory Cascading Termination ✔✔The technique of termina ting all child processes when a parent process terminates. IPC (interprocess communication ) ✔✔A mechanism allowing the exchange of data and information between cooperating processes ALPC(advanced local procedure call) ✔✔The scheme in which the sende r process and the receiver process must name the other to communicate Parallelism ✔✔Performing more than one task simultaneously Concurrency ✔✔Allowing all running tasks to make progress Green thread ✔✔A thread library available for Solaris system s PThread ✔✔Specification for thread behavior. May be provided either as user -level or kernel -level (POSIX threads ) Parallel regions ✔✔Blocks of code that may run in parallel

Document information

Uploaded on
February 4, 2024
Number of pages
29
Written in
2023/2024
Type
Exam (elaborations)
Contains
Questions & answers
$11.89

Wrong document? Swap it for free Within 14 days of purchase and before downloading, you can choose a different document. You can simply spend the amount again.
Written by students who passed
Immediately available after payment
Read online or as PDF

Seller avatar
Reputation scores are based on the amount of documents a seller has sold for a fee and the reviews they have received for those documents. There are three levels: Bronze, Silver and Gold. The better the reputation, the more your can rely on the quality of the sellers work.
QUINTER
3.6
(73)
Sold
413
Followers
105
Items
40085
Last sold
3 days ago



Why students choose Stuvia

Created by fellow students, verified by reviews

Quality you can trust: written by students who passed their tests and reviewed by others who've used these notes.

Didn't get what you expected? Choose another document

No worries! You can instantly pick a different document that better fits what you're looking for.

Pay as you like, start learning right away

No subscription, no commitments. Pay the way you're used to via credit card and download your PDF document instantly.

Student with book image

“Bought, downloaded, and aced it. It really can be that simple.”

Alisha Student

Working on your references?

Create accurate citations in APA, MLA and Harvard with our free citation generator.

Working on your references?

Frequently asked questions