Explain bounded buffer and unbounded buffer, Operating System

Assignment Help:

Explain bounded buffer and unbounded buffer.

Here in a producer-consumer problem the producer process produces information that is consumed by a consumer process. At this time a buffer is used and that buffer is filled by the producer and emptied by the consumer.

A buffer maybe bounded or unbounded

Unbounded buffer: The consumer may have to wait for new items however the producer can always produce new items an unbounded buffer places no practical limit on the size of the buffer.

Bounded buffer: A bounded buffer supposed that there is a fixed buffer size. In this case the consumer should wait if the buffer is empty and the producer must wait if the buffer is full.

 


Related Discussions:- Explain bounded buffer and unbounded buffer

Protection, protection in operating system

protection in operating system

Quick, why we say " OS is a resource allocator" and “OS is a control progr...

why we say " OS is a resource allocator" and “OS is a control program"?

Network operating system and a distributed operating system, Problem: (...

Problem: (a) (i) Explain what a single system image is and how it is related to the concept of a distributed operating system? (ii) What are the main differences between a

Illustrate the handshaking protocol, Q. The instance of handshaking used 2...

Q. The instance of handshaking used 2 bits: a busy bit as well as a command-ready bit. Is it probable to implement this handshaking with only 1 bit? If it is illustrate the protoc

Nested Macro calls, . Nested Macro calls are expanded using the

. Nested Macro calls are expanded using the

What is co-operative process, What is co-operative process? A process i...

What is co-operative process? A process is co-operating if it can influence or be affected by the other processes implementing in the system. Any process that share data with o

Management, what is secondary storage management

what is secondary storage management

Explain fifo page replacement, FIFO page replacement This is the easie...

FIFO page replacement This is the easiest page replacement algorithm. At this juncture the 1 st page entering is the 1 st to leave that is the oldest page leaves. To execute

Define rotational latency and disk bandwidth, Define rotational latency and...

Define rotational latency and disk bandwidth. Rotational latency is the additional time waiting for the disk to rotate the wanted sector to the disk head. The disk bandwidth is

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd