Scribd
Upload
240 views

Operating Systems: 1. Explain Belady's Anomaly

Belady's Anomaly occurs when increasing the number of frames allocated to a process causes execution time to increase, contrary to expectations, due to certain page reference patterns. A binary semaphore takes values of 0 and 1 and is used to implement mutual exclusion and synchronize concurrent processes. Thrashing occurs when the processor spends most of its time swapping pages rather than executing instructions due to an excessive number of page faults.

Uploaded by

Nicholas Williams
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
240 views

Operating Systems: 1. Explain Belady's Anomaly

Belady's Anomaly occurs when increasing the number of frames allocated to a process causes execution time to increase, contrary to expectations, due to certain page reference patterns. A binary semaphore takes values of 0 and 1 and is used to implement mutual exclusion and synchronize concurrent processes. Thrashing occurs when the processor spends most of its time swapping pages rather than executing instructions due to an excessive number of page faults.

Uploaded by

Nicholas Williams
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Operating Systems

1. Explain Belady's Anomaly.


Also called FIFO anomaly. Usually, on increasing the number of frames
allocated to a process' virtual memory, the process execution is faster, because
fewer page faults occur. Sometimes, the reverse happens, i.e., the execution time
increases even when more frames are allocated to the process. This is Belady's
Anomaly. This is true for certain page reference patterns.

2. What is a binary semaphore? What is its use?


A binary semaphore is one, which takes only 0 and 1 as values. They are
used to implement mutual exclusion and synchronize concurrent processes.

3. What is thrashing?
It is a phenomenon in virtual memory schemes when the processor spends
most of its time swapping pages, rather than executing instructions. This is due to
an inordinate number of page faults.

4. What are short-, long- and medium-term scheduling?


Long term scheduler determines which programs are admitted to the system
for processing. It controls the degree of multiprogramming. Once admitted, a job
becomes a process.

Medium term scheduling is part of the swapping function. This relates to


processes that are in a blocked or suspended state. They are swapped out of real-
memory until they are ready to execute. The swapping-in decision is based on
memory-management criteria.

Short term scheduler, also know as a dispatcher executes most frequently,


and makes the finest-grained decision of which process should execute next. This
scheduler is invoked whenever an event occurs. It may lead to interruption of one
process by preemption.

5. What are turnaround time and response time?


Turnaround time is the interval between the submission of a job and its
completion. Response time is the interval between submission of a request, and the
first response to that request.

6. When is a system in safe state?


The set of dispatchable processes is in a safe state if there exists at least one
temporal order in which all processes can be run to completion without resulting in
a deadlock.
7. What is busy waiting?
The repeated execution of a loop of code while waiting for an event to occur
is called busy-waiting. The CPU is not engaged in any real productive activity during
this period, and the process does not progress toward completion.

8. What are local and global page replacements?


Local replacement means that an incoming page is brought in only to the
relevant process' address space. Global replacement policy allows any page frame
from any process to be replaced. The latter is applicable to variable partitions model
only.

9. What is time-stamping?
It is a technique proposed by Lamport, used to order events in a distributed
system without the use of clocks. This scheme is intended to order events
consisting of the transmission of messages. Each system 'i' in the network
maintains a counter Ci. Every time a system transmits a message, it increments its
counter by 1 and attaches the time-stamp Ti to the message. When a message is
received, the receiving system 'j' sets its counter Cj to 1 more than the maximum of
its current value and the incoming time-stamp Ti. At each site, the ordering of
messages is determined by the following rules: For messages x from site i and y
from site j, x precedes y if one of the following conditions holds....(a) if Ti<Tj or (b)
if Ti=Tj and i<j.

10.In the context of memory management, what are placement and replacement
algorithms?
Placement algorithms determine where in available real-memory to load a
program. Common methods are first-fit, next-fit, best-fit. Replacement algorithms
are used when memory is full, and one process (or part of a process) needs to be
swapped out to accommodate a new program. The replacement algorithm
determines which are the partitions to be swapped out.

11.What are demand- and pre-paging?


With demand paging, a page is brought into memory only when a location on
that page is actually referenced during execution. With pre-paging, pages other
than the one demanded by a page fault are brought in. The selection of such pages
is done based on common access patterns, especially for secondary memory
devices.

12.What are the key object oriented concepts used by Windows NT?
➢ Encapsulation
➢ Object class and instance
1. What are the reasons for process suspension?
➢ swapping
➢ interactive user request
➢ timing
➢ parent process request

1. What is process migration?


It is the transfer of sufficient amount of the state of process from one
machine to the target machine

2. What is an idle thread?


The special thread a dispatcher will execute when no ready thread is found.

You might also like