Explain concept of buffering, Operating System

Assignment Help:

Buffering

Messages exchanged by communication processes reside in a impermanent queue. Such a queue can be executed in three ways.

Zero capacity: The queue length is 0. In this case, the sender must block unless the recipient receives the message.
Bounded capacity: The queue has finite length n, at most n message can reside in it.

If the link is full, the sender must block unless space is available in the queue.

Related Discussions:- Explain concept of buffering

Define cpu scheduling, Define CPU scheduling. CPU scheduling is the met...

Define CPU scheduling. CPU scheduling is the method of switching the CPU among several processes. CPU scheduling is the basis of multiprogrammed operating systems. By switching

What are the issues in designing a network-fault tolerance, Fault tolerance...

Fault tolerance : Machine failures, Communication faults, storage device crashes, and decays of storage media must be tolerated by the system to some extent. A fault tolerant sy

Evaluate the physical address, Compare between the one and two-dimensional ...

Compare between the one and two-dimensional memory organizations in terms of the memory structure, advantages, and disadvantages. Which approach would better support the needs o

How does ntfs handle data structures, Q. How does NTFS handle data structur...

Q. How does NTFS handle data structures? How does NTFS recover from a system crash? What is guaranteed after a recovery takes place? Answer: In NTFS all file-system data stru

Example of producer consumer - semaphore, Now let's implement bounded produ...

Now let's implement bounded producer-consumer with semaphores, a Coke machine which is initially empty: semaphore sem_mutex = 1 // binary semaphore for mutual exclusion, 1==unlo

AIMMS3.9, Do you have writers that can use the software AIMMS version 3.9?

Do you have writers that can use the software AIMMS version 3.9?

Explain optimal page replacement, Optimal page replacement An optimal ...

Optimal page replacement An optimal page replacement algorithm has the least page fault rate of all algorithms. The algorithm states that a 'replace the page that will not be

Explain how indefinite blocking or starvation occur, explain how indefinit...

explain how indefinite blocking or starvation occurs..

Explain about deadlock detection, Explain about deadlock detection? In ...

Explain about deadlock detection? In deadlock situation, the system must provide An algorithm that verifies the state of the system to verify whether a deadlock has occu

What is a relocatable program, What is a Relocatable program? The Reloc...

What is a Relocatable program? The Relocatable programs can be loaded almost anywhere in memory.

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages