Explain lru additional reference bits algorithm, Operating System

Assignment Help:

Additional Reference bits algorithm

Here we keep an 8-bit byte for every page in memory. At standard intervals the reference bit is shifted by the OS. If a shift register contains 00000000 then the page hasn't been used for the last 8 time periods. A page with a history 11000000 is more recently used than 01000000. The no of bits are able to be varied accordingly to the needs of the OS.

Related Discussions:- Explain lru additional reference bits algorithm

Thread safety, What does it mean for something to be thread-safe? By saying...

What does it mean for something to be thread-safe? By saying that X is thread-safe, we mean that if multiple threads use X at the same time, we don't have to worry about concurrenc

Write a short note on peer-to-peer computing, Write a short note on peer-to...

Write a short note on peer-to-peer computing. Peer-to-peer (P2P) system model is a kind of distributed OS. In this model, clients and servers aren't distinguished from one anot

MICROKERNEL, ADVANTAGES OF MICROFERNEL IN YSTEM DESIGN?

ADVANTAGES OF MICROFERNEL IN YSTEM DESIGN?

What are files and explain the access methods for files, What are files and...

What are files and explain the access methods for files? File definition Attributes, operations and types Direct access Sequential access with diagram Other access

Process creation, what is process creation and how to create a process

what is process creation and how to create a process

Define a election algorithm, Consider a setting where processors are not as...

Consider a setting where processors are not associated with unique identifiers but the total number of processors is known and the processors are organized along a bidirectional ri

Operating system services, explain about oprating system services and topic...

explain about oprating system services and topics briefly

Example of semaphore, For example, by initializing a semaphore to 0, thread...

For example, by initializing a semaphore to 0, threads can wait for an event to occur, and impose an ordering constraint, similar to a monitor using condition variables, but with m

Define implementation of segmentation with an example, IMPLEMENTATION OF SE...

IMPLEMENTATION OF SEGMENTATION WITH AN EXAMPLE Segmentation is a memory-management scheme that represents the user view of memory. A logical address space is the collection of

We can view an operating system as a resource allocator, We can view an ope...

We can view an operating system as a resource allocator. Explain. We can outlook an operating system as a resource allocator. A computer system has Many resources (software and

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages