-
Notifications
You must be signed in to change notification settings - Fork 1
/
Laborator6_ex2.c
143 lines (118 loc) · 2.89 KB
/
Laborator6_ex2.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <errno.h>
#include <sys/types.h>
#include <sys/sysmacros.h>
#include <pthread.h>
/* this data is shared by the thread */
unsigned int n, m, p, q;
int **A, **B;
int count = 0;
int **init_matrix(int , int);
void *multiplication(void *); /* thread call in this function */
int main(int argc, char *argv[])
{
if(argc != 5)
{
fprintf(stderr, "Invalid arguments list!");
return -1;
}
n = atoi(argv[1]);
m = atoi(argv[2]);
p = atoi(argv[3]);
q = atoi(argv[4]);
if(n < 0 || m < 0 || p < 0 || q < 0)
{
fprintf(stderr, "The arguments must be natural numbers!");
return -1;
}
if(p != q)
{
fprintf(stderr, "Cannot perform the multiplication! (columns number of A != lines number of B)");
exit(EXIT_FAILURE);
}
A = init_matrix(m, p);
B = init_matrix(p, n);
if(A == NULL || B == NULL)
{
fprintf(stderr, "Memory allocation failure!");
return -1;
}
fprintf(stdout, "Matrix A: \n");
for(int i = 0; i < m; i++)
{
for(int j = 0; j < p; j++)
fprintf(stdout, "%d ", A[i][j]);
fprintf(stdout, "\n");
}
fprintf(stdout, "\nMatrix B: \n");
for(int i = 0; i < p; i++)
{
for(int j = 0; j < n; j ++)
fprintf(stdout, "%d ", B[i][j]);
fprintf(stdout, "\n");
}
pthread_t* threads = (pthread_t*)malloc((m*n)*sizeof(pthread_t));
if(threads == NULL)
{
fprintf(stderr, "Memory allocation failure!");
exit(EXIT_FAILURE);
}
//Creating a thread for a single element of the resultant matrix, each threads is evaluating its own part
int *data = NULL;
for(int i = 0; i < m; i++)
{
for(int j = 0; j < n; j++)
{
//storing the column of the first matrix and the line of the second one which will be passed as argument
data = (int*)malloc((m + n + 1) * sizeof(int));
data[0] = p;
for(int k = 0; k < p; k++)
data[k + 1] = A[i][k];
for(int k = 0; k < p; k++)
data[p + 1 + k] = B[k][j];
if(pthread_create(&threads[count++], NULL, multiplication, (void*)(data)))
{
perror(NULL);
return errno;
}
}
}
printf("\nOutput: resultant matrix: \n");
for(int i = 0; i < m*n; i++)
{
void* collect;
//Joinig all tthreads and collecting return value
pthread_join(threads[i], &collect);
printf("%d ", *(int *)collect);
if((i + 1) % n == 0)
printf("\n");
}
return 0;
}
int **init_matrix(int L, int C)
{
int **matrix = (int**)malloc(L * sizeof(int*));
for(int i = 0; i < L; i++)
matrix[i] = (int*)calloc(C, sizeof(int));
for(int i = 0; i < L; i++)
{
for(int j = 0; j < C; j++)
{
matrix[i][j] = rand() % (L * C + 1);
}
}
return matrix;
}
void *multiplication(void *arg)
{
int *elements = (int*)arg;
int ncolumn = elements[0]; // number of columns of the firts matrix = number of lines of the second matrix
int sum = 0;
for(int i = 1; i <= ncolumn; i++)
sum += elements[i] * elements[i + ncolumn];
int *result = (int*)malloc(sizeof(int));
*result = sum;
pthread_exit(result);
}