multithreading, For this assignment we will be solving the producer-consumer problem with, JAVA Programming

multithreading, JAVA Programming

Assignment Help:

For this assignment we will be solving the producer-consumer problem with a bounded buffer. You are required to implement this assignment in Java. There are three components in this assignment.

(1) The Bounded Buffer: This buffer can hold a fixed number of items. The number of elements in this buffer is limited to 1000. This buffer needs to be a first-in first-out (FIFO) buffer. You should implement this as a Circular Buffer that satisfies the FIFO property and is restricted to hold at most 1000 items at a time.

(2) Producer: The producer is responsible for producing data items to be added to the buffer. If the buffer is full, the producer must wait for the consumer to consume at least one item before it
can add a new item to the buffer. The producer is required to produce a total of 1,000,000 items.
The item that the producer adds to the buffer is a random Double that is generated using java.util.Random.
Random random = new Random();
Double bufferElement = random.nextDouble() * 100.0;

(3) Consumer: The consumer is responsible for consuming elements from the buffer. If the buffer is empty the consumer must wait for the producer to add an item to the buffer. The consumer is required to consume all elements (1,000,000) generated by the producer.
There should be exactly one instance of the buffer, producer, and consumer. The producer and consumer must reference the same buffer. You can only use wait() and notify() as the primitives to synchronize access to the buffer.
Correctness:
To verify the correctness of your program both the producer and consumer are required to maintain running totals of the values of the items added-to/removed-from the buffer. This would be maintained in a variable bufferValueCounter.
Since the buffer is a FIFO buffer, the value reported for the two items below should be the same:
(a) The first N elements generated by the producer
(b) The first N elements consumed by the consumer

Requirements of Task

1) Implement the FIFO Circular Buffer and ensure that the buffer can hold a maximum of 1000
items at a time.
2) Consumer should wait if there are no items in the buffer
3) Producer should wait if the buffer is full
4) Ensure that the producer can produce 1,000,000 items and the consumer can consume 1,000,000, items with a bounder buffer that can hold at most 1000 items at a time.
a. You should not run out of memory. Remember, your producer should not produce if the buffer is full. You should not set the size of the Java VM in your makefile or expect that
the JVM will be set to a certain value.
b. Your solution must satisfy the correctness constraint i.e. you consume each item exactly once, in the order that it was produced, and demonstrate this by printing out the value
of your counter (at both the producer and consumer) every time you have produced or consumed 100,000 elements. See the example output below; note how the counter values match at the producer and consumer for the same N.
c. There should be no deadlock. Your program will be executed 5 times, and it should run
to completion every time without a deadlock.

Example:
Print out of what the outputs of the executing programs look like
> java ProducerConsumer
Producer: Generated 100,000 items, Cumulative value of generated items=abc.def
Consumer: Consumed 100,000 items, Cumulative value of consumed items=abc.def
Producer: Generated 200,000 items, Cumulative value of generated items=ghi.jkl
Consumer: Consumed 200,000 items, Cumulative value of consumed items=ghi.jkl
Producer: Generated 300,000 items, Cumulative value of generated items=mno.pqr
Consumer: Consumed 300,000 items, Cumulative value of consumed items=mno.pqr
Producer: Generated 400,000 items, Cumulative value of generated items=stu.vwx
Consumer: Consumed 400,000 items, Cumulative value of consumed items=stu.vwx
Producer: Generated 500,000 items, Cumulative value of generated items=yza.bcd
Consumer: Consumed 500,000 items, Cumulative value of consumed items=yza.bcd
Producer: Generated 600,000 items, Cumulative value of generated items=efg.hij
Consumer: Consumed 600,000 items, Cumulative value of consumed items=efg.hij
Producer: Generated 700,000 items, Cumulative value of generated items=klm.nop
Consumer: Consumed 700,000 items, Cumulative value of consumed items=klm.nop
Producer: Generated 800,000 items, Cumulative value of generated items=qrs.tuv
Consumer: Consumed 800,000 items, Cumulative value of consumed items=qrs.tuv
Producer: Generated 900,000 items, Cumulative value of generated items=wxy.zab
Consumer: Consumed 900,000 items, Cumulative value of consumed items=wxy.zab
Producer: Generated 1,000,000 items, Cumulative value of generated items=cde.fgh
Consumer: Consumed 1,000,000 items, Cumulative value of consumed items=cde.fgh
Producer: Finished generating 1,000,000 items
Consumer: Finished consuming 1,000,000 item
Exiting …

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages

multithreading, JAVA Programming

Related Discussions:- multithreading

Conditional Operators, I need a chart and how this works with java? The fun...

Explain declaring- allocating and initializing two dimension, Explain the f...

Creating a system to keep track of computer science books, You are part of ...

Physics, s=1/2at*2

Determine the types of object oriented programme, Determine the types of ob...

Calculates number of negative and positive numbers in array, Question 3 ...

Input from a Disk File, What are the conditions for exiting the while loop?...

Implement queues - linked list, Implement Queues / Linked List Project D...

Application to upload dicom files from cd to dropbox, Application or websit...

Liferay especialist and java programmer, Liferay Especialist and Java Progr...

Write Your Message!

Featured Services

Online Tutoring

Project Development

Exam Preparation

Course Help

Assignment Help

Popular Subjects

Assured A++ Grade

Academics

Major Subjects

Majors

Get In Touch

TERMS & POLICIES

HELP & SUPPORT