Producer - consumer synchronization, Operating System

Assignment Help:

This assignment is based on Programming Project 6.40 in Silbershatz. Implement the ProducerXConsumer program according to the instructions for Project 6.40 for both Linux and Win32 threads. (1) However BEFORE you add any synchronization to your code use sleep()/usleep() calls to force your code to produce as many different types of synchronization bugs as possible.  Use the output produced by your program and for your Linux implementation only also use 'strace -f' to explain how and where in your code the synchronization bugs occur.  Be sure to use the command line argument for strace - see the man pages for details on this Each of your threads should fprint out a line of output to stderr when it is first started, and again when each buffer of input/output is processed.  

Submit code and annotated  test output for these experiments explaining where the race conditions occur.

NEXT, modify your code by adding appropriate synchronization (mutex locks and/or signal semaphores and/or count semaphores) so that it always executes correctly.   Use diff on Linux & comp on Windows to verify that the input & output files are identical by annotating your trace output clearly and concisely and using diff/comp to compare the contents of the input & output files.  Explain the logic of how you synchronized your code in your design documentation by submitting high level pseudocode with semaphore synchronization (init, p(), v()) and an explanation of the logic that you used; (2)  submit wellXcommented source code and annotated output (including strace listings) to demonstrate that your code is executing correctly, despite the sleep/usleep commands from the previous part.

Run your final program with 3 buffers (each of which is 13 bytes long),  6 producers, 3 consumers and a file that contains about 200 bytes; annotate & submit this output. (3) For the third part of this assignment, modify your synchronization so that a deadlock condition occurs, and document this situation by explaining in your design documentation how deadlock was produced in your code and how it can be avoided.


Related Discussions:- Producer - consumer synchronization

What is super block, What is super block A partition control block have...

What is super block A partition control block have partitions details, such as the number of blocks in the partition, size of the blocks, free-blocks and free-block pointers an

Page faults, Assume there are only 4 page frames in the physical memory, fo...

Assume there are only 4 page frames in the physical memory, for the following reference string: 1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8, 9, 7, 8, 9, 5, 4, 5, 4, 2, 8. a) What i

Prevention of a data race in a parallelised program, Present your own fully...

Present your own fully documented and tested programming example illustrating the prevention of a data race in a parallelised program. This is an example where total number of p

Define programming fundamentals for client- server developer, Define the Pr...

Define the Programming Fundamentals for Client- Server Developers Coding for client - server enforces good programming fundamentals. In order for applications to become client

What is the basic approach of page replacement, What is the basic approach ...

What is the basic approach of page replacement? If no frame is free is available, find one that is not presently being used and free it. A frame can be freed by writing its con

Define most common phase structured grammar, Which is most common phase str...

Which is most common phase structured grammar? Most common phase structured grammar is Context – Sensitive

Structures for a file''s data, Q. Likewise some systems support many types ...

Q. Likewise some systems support many types of structures for a file's data while others simply support a stream of bytes. What are the merits in addition to demerits? Answer:

How can the deadlock be prevented-bankers algorithm, How can the deadlock b...

How can the deadlock be prevented Bankers algorithm : The Resource allocation graph algorithm isn't applicable to a resource allocation system with multiple instances of every

What is meant by demand paging? explain, What is meant by demand paging? Ex...

What is meant by demand paging? Explain. Demand paging is a technique to implement virtual memory. In demand paging simply when a page is required it is brought into memory. As

Define projected allocation state is safe - banker algorithm, A system cons...

A system consists of 10 units of resource class Ru. The resource needs of three user processes P1, P2 and P3 are like this                     Using Banker's algorithm, de

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