CS3413/Assignment5/hard_affinity.c

#include <stdio.h>
#include <pthread.h>
#include <semaphore.h>
#include <stdlib.h>
#include "lib/queue.h"

#define MAX_USERNAME_LENGTH 100
int *QUANTUM;
int CPUS;

sem_t print_sem;
sem_t sim_sem;
pthread_mutex_t finish_mutex;
pthread_mutex_t time_mutex;

pthread_mutex_t summary_mutex;

int finish_count = 0;
int TIME = 1;
typedef struct ThreadArgs {
	int cpu_id;
	char *print_buffer;
	Queue *summary_queue;
	Queue *in_queue;
} ThreadArgs;

ThreadArgs *createArgs(int cpu_id, char *print_buffer, Queue *summary_queue, Queue *in_queue) {
	ThreadArgs *args = malloc(sizeof(ThreadArgs));
	args->cpu_id = cpu_id;
	args->print_buffer = print_buffer;
	args->summary_queue = summary_queue;
	args->in_queue = in_queue;
	return args;
}

Queue *input_queue() {
	Queue *queue = createQueue();
	char username[MAX_USERNAME_LENGTH]; // username buffer
	char job;
	int arrival_time, duration, affinity;

	scanf("%d", &CPUS);
	while (getchar() != '\n'); // clear the newline from the buffer

	// Allocate dynamic quantum array
	QUANTUM = malloc(sizeof(int) * CPUS);
	int i = 0;
	while (i < CPUS) {
		scanf("%d", &QUANTUM[i]);
		i++;
	}
	while (getchar() != '\n'); // clear the newline from the buffer

	while (getchar() != '\n'); // ignore the rest of the line, this is the table line
	// Loop through the process table and enqueue each process
	while (scanf("%99s %c %d %d %d", username, &job, &arrival_time, &duration, &affinity) != EOF) {
		Process *process = createProcess(username, job, arrival_time, duration, affinity);
		enqueue(queue, process);
	}
	return queue;
}

int getTime() {
	pthread_mutex_lock(&time_mutex);
	int time = TIME;
	pthread_mutex_unlock(&time_mutex);
	return time;
}

void incrementTime() {
	pthread_mutex_lock(&time_mutex);
	TIME++;
	pthread_mutex_unlock(&time_mutex);
}

int getFinishCount() {
	pthread_mutex_lock(&finish_mutex);
	int count = finish_count;
	pthread_mutex_unlock(&finish_mutex);
	return count;
}

void incrementFinishCount() {
	pthread_mutex_lock(&finish_mutex);
	finish_count++;
	pthread_mutex_unlock(&finish_mutex);
}

void *print(void *args) {
	// Cast args and create local variables
	ThreadArgs *thread_args = (ThreadArgs *) args;
	char *print_buffer = thread_args->print_buffer;

	// Print the Time label as well as the CPU labels
	printf("Time");
	for (int i = 0; i < CPUS; i++) {
		printf("\tCPU%d", i);
	}
	printf("\n");

	bool finished = false;

	while (finished == false) {
		// Wait for all the simulation threads to finish
		for (int i = getFinishCount(); i < CPUS; ++i) {
			sem_wait(&print_sem);
		}

		int time = getTime();

		// Print the time and the print buffer
		printf("%d", time);
		for (int i = 0; i < CPUS; ++i) {
			printf("\t%c", print_buffer[i]);
		}
		printf("\n");

		// Check if every process is done
		if (getFinishCount() == CPUS) {
			finished = true;
		}

		// Essentially increase the time right before simulating
		incrementTime();

		// Increment the simulation semaphore to let the simulation threads run
		for (int i = getFinishCount(); i < CPUS; ++i) {
			sem_post(&sim_sem);
		}
	}

	// Print the summary
	printf("\nSummary\n");
	pthread_mutex_lock(&summary_mutex);
	printList(thread_args->summary_queue);
	pthread_mutex_unlock(&summary_mutex);
	return NULL;
}


void *simulation(void *args) {
	// Cast args and create local variables
	ThreadArgs *thread_args = (ThreadArgs *) args;
	Queue *in_queue = thread_args->in_queue;
	Queue *summary_queue = thread_args->summary_queue;
	char *print_buffer = thread_args->print_buffer;
	int cpu_id = thread_args->cpu_id;

	// Loop variables
	int quantum = QUANTUM[cpu_id];
	int addedJobs = 0;
	int numberOfJobsForThisCPU = 0;
	int time = 0;
	int previousTime;
	Process *process = NULL;

	// Count number of jobs this CPU has to do
	process = in_queue->end;
	for (int i = 0; i < in_queue->size; ++i) {
		if (process->affinity == cpu_id) {
			numberOfJobsForThisCPU++;
		}
		process = process->prev_elem;
	}

	bool finished = false;
	// Create a queue for the simulation
	Queue *sim_queue = createQueue();
	while (finished == false) {
		// Only simulate if the time has changed
		previousTime = time;
		time = getTime();
		if (previousTime != time) {
			sem_wait(&sim_sem);
			// Begin going through all jobs and enqueueing them if they have arrived
			process = in_queue->end;
			for (int i = 0; i < in_queue->size; i++) {
				if (process->affinity == cpu_id && process->arrival_time == time) {
					// Create copy to keep the queues separate
					Process *copy = createProcess(process->username, process->job, process->arrival_time, process->duration, process->affinity);
					enqueue(sim_queue, copy);
					addedJobs++;
				}
				process = process->prev_elem;
			}

			// Begin printing the current job
			process = sim_queue->end;
			if (sim_queue->size != 0) {
				print_buffer[cpu_id] = process->job;
				process->duration--;
				quantum--;
				if (process->duration == 0) { // If the process is done, delete it
					Process *temp = dequeue(sim_queue); // Store the process in a temp variable for deletion
					pthread_mutex_lock(&summary_mutex);
					search(summary_queue, temp->username)->finish_time = time; // Set the finish time for the summary queue
					pthread_mutex_unlock(&summary_mutex);
					destroyProcess(temp); // This should be called on every process
					quantum = QUANTUM[cpu_id]; // Make sure to reset the quantum when a process is done
				} else if (quantum == 0) { // If the quantum is 0, then we need to dequeue the process and enqueue it again
					process = dequeue(sim_queue);
					enqueue(sim_queue, process);
					quantum = QUANTUM[cpu_id];
				}
			} else { //If there is nothing in sim_queue, put '-' in the print buffer
				print_buffer[cpu_id] = '-';
				if (addedJobs >= numberOfJobsForThisCPU) {
					finished = true; // If all jobs have been added, and the simulation queue is empty, then we are done
				}
			}
			// Allow the print thread to print because the simulation for this tick is done
			sem_post(&print_sem);
		}
	}
	// Free memory for the simulation queue. There should be nothing left in it
	stop(sim_queue);
	// Signal that the thread is done
	incrementFinishCount();
	return NULL;
}


int main() {
	setvbuf(stdout, NULL, _IONBF, 0);
	Queue *in_queue = input_queue(); // Create the input queue

	// Make sure sem is init right after getting cpus, which is done in input_queue
	sem_init(&print_sem, 0, 0); // Initialize the semaphore
	sem_init(&sim_sem, 0, CPUS); // Initialize the semaphore
	pthread_mutex_init(&finish_mutex, NULL);    // Initialize the mutex
	pthread_mutex_init(&time_mutex, NULL);    // Initialize the mutex
	pthread_mutex_init(&summary_mutex, NULL);    // Initialize the mutex

	Queue *summary_queue = createQueue(); // Create the summary queue
	char *print_buffer = malloc(sizeof(char) * CPUS); // Create the print buffer

	// Summary creation
	Process *process = in_queue->end;
	for (int i = 0; i < in_queue->size; ++i) {
		if (contains(summary_queue, process->username) == false) {
			Process *copy = createProcess(process->username, process->job, process->arrival_time, process->duration, process->affinity);
			enqueue(summary_queue, copy);
		}
		process = process->prev_elem;
	}
	// Create the print thread
	pthread_t print_thread;
	ThreadArgs *print_args = createArgs(0, print_buffer, summary_queue, in_queue);
	pthread_create(&print_thread, NULL, &print, print_args);

	// Create the simulation threads
	pthread_t threads[CPUS];
	ThreadArgs *args[CPUS]; // Array of arguments for each thread, so we can free them later
	for (int i = 0; i < CPUS; i++) {
		args[i] = createArgs(i, print_buffer, summary_queue, in_queue);
		pthread_create(&threads[i], NULL, &simulation, args[i]);
	}

	// Threads simulate, then print
	for (int i = 0; i < CPUS; i++) {
		pthread_join(threads[i], NULL);
		free(args[i]);
	}

	// Wait for print thread to finish
	pthread_join(print_thread, NULL);
	free(print_args);

	stop(in_queue); // Free memory for input queue
	stop(summary_queue); // Free memory for summary queue
	free(print_buffer); // Free memory for print buffer
	free(QUANTUM); // Free memory for quantum array
	return 0;
}