Could you kindly utilize solely my code as I contributed to its development? I emphasize, please utilize only my code.I attached my code below label my code. The question that I need help with: You need to use the pthread for matrix multiplication. Each threadfrom the threadpool should be responsible for computing only a partof the multiplication (partial product as shown in the above picture –all Ti(S) are called a partical product). Your main thread should splitthe matrices accordingly and create the partial data arrays that areneeded to compute each Ti. You must create a unique task with thedata and submit it to the job queue. You can compute the partialproducts concurrently as long as you have threads available in thethreadpool. You have to remove the task the from queue and submitto a thread in the threadpool. You should define the number ofthreads to be 5 and keep it dynamic so that we can test the samecode with a higher or lower number of threads as needed. When allthe partial products are computed all the threads in the threadpoolshould exit and the main thread should regain control, print thecomplete result to the output file.my code:#include <pthread.h>#include <stdlib.h>#include <stdio.h>#include <semaphore.h>#include "threadpool.h" #define QUEUE_SIZE 100#define NUMBER_OF_THREADS 5 #define TRUE 1 typedef struct { void (*function)(void *p); void *data;}task; task worktodo; pthread_t bee; int enqueue(task t) { return 0;} task dequeue() { return worktodo;} void *worker(void *param){ execute(worktodo.function, worktodo.data); pthread_exit(0);} void execute(void (*somefunction)(void *p), void *p){ (*somefunction)(p);} int pool_submit(void (*somefunction)(void *p), void *p){ worktodo.function = somefunction; worktodo.data = p; return 0;} void pool_init(void){ pthread_create(&bee,NULL,worker,NULL);} void pool_shutdown(void){ pthread_join(bee,NULL);}
You need to use the pthread for matrix multiplication. Each thread
from the threadpool should be responsible for computing only a part
of the multiplication (partial product as shown in the above picture –
all Ti(S) are called a partical product). Your main thread should split
the matrices accordingly and create the partial data arrays that are
needed to compute each Ti. You must create a unique task with the
data and submit it to the job queue. You can compute the partial
products concurrently as long as you have threads available in the
threadpool. You have to remove the task the from queue and submit
to a thread in the threadpool. You should define the number of
threads to be 5 and keep it dynamic so that we can test the same
code with a higher or lower number of threads as needed. When all
the partial products are computed all the threads in the threadpool
should exit and the main thread should regain control, print the
complete result to the output file.
my code:
#include <pthread.h>
#include <stdlib.h>
#include <stdio.h>
#include <semaphore.h>
#include "threadpool.h"
#define QUEUE_SIZE 100
#define NUMBER_OF_THREADS 5
#define TRUE 1
typedef struct
{
void (*function)(void *p);
void *data;
}
task;
task worktodo;
pthread_t bee;
int enqueue(task t)
{
return 0;
}
task dequeue()
{
return worktodo;
}
void *worker(void *param)
{
execute(worktodo.function, worktodo.data);
pthread_exit(0);
}
void execute(void (*somefunction)(void *p), void *p)
{
(*somefunction)(p);
}
int pool_submit(void (*somefunction)(void *p), void *p)
{
worktodo.function = somefunction;
worktodo.data = p;
return 0;
}
void pool_init(void)
{
pthread_create(&bee,NULL,worker,NULL);
}
void pool_shutdown(void)
{
pthread_join(bee,NULL);
}
AI-generated content may present inaccurate or offensive content that does not represent bartleby’s views.
Unlock instant AI solutions
Tap the button
to generate a solution
