FIU Implementing a Solution to Critical Section Problem Project – Description
TASK 1:
Implement a solution to the critical section problem for 2 threads using mutex locks OR binary semaphore. It’s up to you to choose one tool.
both two threads need to concurrently increment a shared variable called counter by one 2,000,000 times starting from zero. all global memory is shared among threads of a process. Both threads need to count to 2,000,000 which means the only correct overall count is 4,000,000.
the shared variable count should be defined as follows:
struct shared_data
{
int value; /* shared variable to store result*/
};
struct shared_data *counter;
Thread1 needs to be designed in a way that every time it sees (counter?> value%100) == 0 it increments counter?> value by 100 (bonus). That counts for 100 individual updates. You also need to keep track of how many times the thread got the bonus and report it in its remainder section.
Thread2 does not get any bonus, it only increments counter->value by 1.
you should prevent each thread from counting to more than 2,000,000.
remember the parent process needs to wait for its 2 threads to join.
You can use this Download this code to start with.
TASK 2:
Make comments indicating the following sections in your code:
entry section
critical section
exit section
remainder section
Then, prove that your implementation is a solution to the critical section problem. In other words, prove that you code satisfies the 3 conditions of the critical section solution. You can either add it as a comment in the beginning of your code or submit it in a separate PDF file.
Expected output:
both threads need to report the number of updates done at the end of their remainder sections.
both threads need to report the current value of the shared variable counter at the end of their remainder sections.
thread1 needs to report the number of times it got the bonus at the end of its remainder sections.
Im thread1, I did 2000000 updates and I got the bonus for 16089 times, counter = 2554849
Im thread2, I did 2000000 updates, counter = 4000000
from parent counter = 4000000
The post FIU Implementing a Solution to Critical Section Problem Project first appeared on .
