[Solved] CIS 212 Assignment 7-multiple threads and thread synchronization

The goal of this assignment is to gain experience working with concurrent programming via multiple threads and thread synchronization. You will write an implementation that simulates producer and consumer threads. The consumer will take more time to complete than the producer, causing the machine to run out of memory if threads are not synchronized in such a way that no more than a specified number of units are produced prior to being consumed.

1. Create a new class with a public static void main method that creates a java.util.concurrent.LinkedBlockingQueue with enough capacity for 100 String entries.
2. Create a new class which implements Runnable to simulate the producer. When executed, a total of 1000 random Strings (e.g., using Math.random() and Double.toString()) are added to the above queue. You need to wait until there is space in the queue if necessary (i.e., using the LinkedBlockingQueue<T> put() method to add Strings). Print the progress (i.e., the total number of Strings added so far) once every 100 Strings added.
3. Create another new class which implements Runnable to simulate the consumer. When executed, this thread consumes Strings from the queue. Consumption continues as long as there are Strings in the queue or the producer hasnt finished (i.e., the consumer doesnt quit if the queue happens to be empty before the producer finishes). Use the Thread sleep() method to wait up to 10 milliseconds (i.e., a random number of milliseconds on the range [0, 10)) before each String consumption to ensure that the consumer takes longer time to execute than the producer. Print the progress once every 100 Strings consumed.

You need to implement your program in such a way that it supports one producer and an arbitrary number of consumers. The consumers are expected to consume at different rates, so consumers should not simply consume a predetermined number of Strings and then quit; one consumer may complete significantly earlier than the others and would be idle waiting for the others in this case. As such, you will want a way for your producer to signal its completion to all the consumers (e.g., creating a Boolean variable shared by the producer and all the consumers); you will also need to ensure that you dont have a consumer potentially waiting indefinitely for a String to be produced (e.g., using LinkedBlockingQueue<T> poll() method with a timeout).

4. Execute your program with 1 producer and at least 2 consumers concurrently. Your program needs to automatically quit after all 1000 Strings are produced and consumed. Before quitting, print the summarized information about how many Strings the producer produces and how many Strings each consumer consumes exactly.
5. Write code that is clear and efficient. Specifically, your code should be indented with respect to code blocks, avoid unnecessarily repetitive code, avoid code that is commented out or otherwise unused, use descriptive and consistent class/method/variable names, etc.

The following is an example output for 1 producer and 4 consumers, using the LinkedBlockingQueue<T> implementation:

Producer 1: 100 events produced

Producer 1: 200 events produced

Producer 1: 300 events produced

Producer 1: 400 events produced

Consumer 1: 100 events consumed

Consumer 2: 100 events consumed

Producer 1: 500 events produced

Consumer 4: 100 events consumed

Consumer 3: 100 events consumed

Producer 1: 600 events produced

Producer 1: 700 events produced

Producer 1: 800 events produced

Consumer 1: 200 events consumed

Consumer 3: 200 events consumed

Producer 1: 900 events produced

Consumer 4: 200 events consumed

Consumer 2: 200 events consumed

Producer 1: 1000 events produced Summary:

Producer 1 produces 1000 events.

Consumer 1 consumes 252 events.

Consumer 2 consumes 246 events.

Consumer 3 consumes 255 events.

Consumer 4 consumes 247 events.

6. (Extra credits) Implement all of the above for an arbitrary number of producers and consumers using Javas default LinkedList<T>, rather than LinkedBlockingQueue<T>. Note the following in your implementation:

• [30] LinkedList<T> is not thread-safe, so you need to make sure every time there is only one thread, either a producer or a consumer, exclusively adds or removes a String to or from the list. The total number of Strings added by all producers is exactly 1000.
• [30] LinkedList<T> has no maximum capacity, so you need to find a way to enforce the capacity of 100, so that if this capacity is reached then the producers need to wait (i.e., using the Object wait() method) before adding more Strings.
• [30] If the LinkedList<T> is empty (i.e., nothing to consume for the consumer) but the total added Strings has not reached 1000, then you need to wake up (i.e., using the Object notify()) the producers to let them add more Strings.
• [10] All other requirements are the same as in the LinkedBlockingQueue<T> implementation. Sleep before every String consumption. Print the progress once every 100 Strings are added or consumed, and print a summary information about the exact number of Strings added and consumed by each producer or consumer. Execute your program with at least 2 producers and at least 2 consumers concurrently. Program automatically quits when all production and consumption are done.

The following is an example output for 4 producers and 6 consumers, using the LinkedList<T> implementation:

Producer 3: 100 events produced

Producer 4: 100 events produced

Producer 2: 100 events produced

Producer 1: 100 events produced

Consumer 2: 100 events consumed

Consumer 5: 100 events consumed

Consumer 6: 100 events consumed

Consumer 3: 100 events consumed

Consumer 4: 100 events consumed

Consumer 1: 100 events consumed

Producer 2: 200 events produced

Producer 4: 200 events produced

Producer 3: 200 events produced Producer 1: 200 events produced Summary:

Producer 1 produces 248 events.

Producer 2 produces 253 events.

Producer 3 produces 250 events.

Producer 4 produces 249 events.

Consumer 1 consumes 146 events.

Consumer 2 consumes 178 events.

Consumer 3 consumes 175 events.

Consumer 4 consumes 167 events.

Consumer 5 consumes 162 events.

Consumer 6 consumes 172 events.