Problem: Give an implementation of Semaphore for a multiprocessor
system
using BUSY waiting that can be accessed from the threads of the same
program.
Use this semaphore to write a  program for bounded-buffer problem in
which
there are p producers and q consumers. Each producer or consumer should
be
in infinite loop, and sleeps sifficiently so that it gives a display in
the
terminal which can be viewed properly.


Hint: Use assembly language statement test-and-set or
equivalent instruction using asm staement to realize CS for semaphore.

Need help by tomorrow

[ Post a follow-up to this message ]