diff --git a/src/par b/src/par index ffafc83fe9e030b3ca6386844af9bd6f87ef3bf2..23fe37ce47d562518349e7e07a6fd6c375d7f3ac 100644 Binary files a/src/par and b/src/par differ diff --git a/src/parallel.c b/src/parallel.c index 2f3cec54697f6cdfe811a0c627be4bfefcea53f2..d8f4649fb43c9f80599ff6cba6c0d484df449bdc 100644 --- a/src/parallel.c +++ b/src/parallel.c @@ -345,19 +345,6 @@ int main() { // --------------------------- End Create the datatype ----------------------------- // // Distribusi matriks input ke process-process - - /* - 0 1 2 3 4 5 6 7 8 9 - - 0 1 2 - - 3 4 5 - - 6 7 8 - - 9 10 11 - - */ int root = 0; int divide = num_targets/(world_size-1); @@ -409,13 +396,9 @@ int main() { // Allocate a buffer to hold the incoming numbers int* number_buf = (int*)malloc(sizeof(int) * number_amount); - MPI_Recv(number_buf, number_amount, MPI_INT, i, 0, MPI_COMM_WORLD, MPI_STATUS_IGNORE); printf("\nPROCESS 0 IN RECEIVING\n"); print_array(number_buf,number_amount); - //[3] - //[46] - //[22] for (int j=0; j<number_amount; j++){ arr_range[idxArrRange] = number_buf[j]; @@ -423,6 +406,27 @@ int main() { } } } + + // sort the data range array + printf("BAWAHNYA PRINT ARRAY\n"); + print_array(arr_range,num_targets); + merge_sort(arr_range, 0, num_targets - 1); + + + printf("AFTER SORT\n"); + print_array(arr_range,num_targets); + + int median = get_median(arr_range, num_targets); + int floored_mean = get_floored_mean(arr_range, num_targets); + + // print the min, max, median, and floored mean of data range array + printf("HASIL FINALLLL\n"); + printf("MIN : %d\nMAX : %d\nMedian : %d\nRata-Rata : %d\n", + arr_range[0], + arr_range[num_targets - 1], + median, + floored_mean); + } else { Matrix kernel_recv; MPI_Recv(&kernel_recv, 1, mat_MPI, root, 0, MPI_COMM_WORLD, MPI_STATUS_IGNORE); @@ -520,41 +524,29 @@ int main() { // } // } - printf("HOOOOOOOOOOOOOOO\n"); - - - MPI_Finalize(); - + // // sort the data range array + // printf("BAWAHNYA PRINT ARRAY\n"); // print_array(arr_range,num_targets); - // Print hasil - // for (int i = 0; i < num_targets; i++) { - // printf("\nMATRIX CONV %d",i); - // print_matrix(arr_mat2); - // } - - // sort the data range array - printf("BAWAHNYA PRINT ARRAY\n"); - print_array(arr_range,num_targets); - merge_sort(arr_range, 0, num_targets - 1); + // merge_sort(arr_range, 0, num_targets - 1); - printf("AFTER SORT\n"); - print_array(arr_range,num_targets); + // printf("AFTER SORT\n"); + // print_array(arr_range,num_targets); - int median = get_median(arr_range, num_targets); - int floored_mean = get_floored_mean(arr_range, num_targets); + // int median = get_median(arr_range, num_targets); + // int floored_mean = get_floored_mean(arr_range, num_targets); + // // int floored_mean = 10; - // print the min, max, median, and floored mean of data range array - printf("HASIL FINALLLL\n"); - printf("MIN : %d\nMAX : %d\nMedian : %d\nRata-Rata : %d\n", - arr_range[0], - arr_range[num_targets - 1], - median, - floored_mean); + // // print the min, max, median, and floored mean of data range array + // printf("HASIL FINALLLL\n"); + // printf("MIN : %d\nMAX : %d\nMedian : %d\nRata-Rata : %d\n", + // arr_range[0], + // arr_range[num_targets - 1], + // median, + // floored_mean); - - - // START OPEN MP - + // // START OPEN MP + + MPI_Finalize(); return 0; }