computer architecture, Race conditions, Semaphore and Mutex lock. C programing

Programming problem 6.33 from the 10th edition with modifications. Assume that a finite number of resources of a single resource type must be managed. Processes may ask for a number of these resources and will return them once finished. As an example, many commercial software packages provide a given number of licenses, indicating the number of applications that may run concurrently. When the application is started, the license count is decremented. When the application is terminated, the license count is incremented. If all licenses are in use, requests to start the application are denied. Such a request will be granted only when an existing license holder terminates the application and a license is returned. The following program segment is used to manage a finite number of instances of an available resource. The maximum number of resources and the number of available resources are declared as follows:

#define MAX_RESOURCES 5

int available_resources = MAX_RESOURCES;

/** When a process wishes to obtain a number of resources, it invokes the

* decrease_count() function: */

/* decrease available_resources by count resources */

/* return 0 if sufficient resources available, */

/* otherwise return -1 */

int decrease_count(int count)

{

if (available_resources < count)

return -1;

else

{

available_resources -= count;

return 0;

}

}

/** When a process wants to return a number of resources, it calls the

increase_count() function: /*

/* increase available_resources by count */

int increase_count(int count)

{

available_resources += count;

return 0;

}

The preceding program segment produces a race condition. Do the following:

a. (5%) Identify the data involved in the race condition.

b. (5%) Identify the location (or locations) in the code where the race condition occurs.

c. (70%) Using a semaphore or mutex lock, fix the race condition. It is permissible to modify the decrease_count() function so that the calling process is blocked until sufficient resources are available. The code for this solution must read a set of integers from the command line. The first integer is MAX_RESOURCES. Subsequent integers will be negative to decrease resources, and positive to increase resources. As indicated decrease_count() can be modified, but must return -1 if the requested resources > MAX_RESOURCES. Output should be the results from each call. For example, a MAX_RESOURCES of 5 with 3 calls would result in the following:

./a.out 5 -4 -2 2

0, -1, 0