to determine wall clock time

[ue-pp-sortingalgorith.git] / parallel-sorting.c

diff --git a/parallel-sorting.c b/parallel-sorting.c
index 1b6aff4050b373d1d187c1d35fda8d0583914762..0ce2eb2ffb8d3060debd0739a81d02d9dca3be72 100644 (file)
--- a/parallel-sorting.c
+++ b/parallel-sorting.c
@@ -2,6 +2,8 @@
 #include <stdlib.h>
 #include <string.h>
 #include <omp.h>
 #include <stdlib.h>
 #include <string.h>
 #include <omp.h>

+#include <time.h>
+

 
 // Global variables (simulating shared memory access for simplicity)
 int* data = NULL;
 
 // Global variables (simulating shared memory access for simplicity)
 int* data = NULL;


@@ -156,7 +158,7 @@ int write_file(const char* filename) {
 
 
 int main(int argc, char *argv[]) {
 
 
 int main(int argc, char *argv[]) {

-    // --- 1. Handle Command Line Arguments ---
+    // Handle Command Line Arguments

     int thread_count = -1;
     char *input_file = NULL;
     char *output_file = NULL;
     int thread_count = -1;
     char *input_file = NULL;
     char *output_file = NULL;


@@ -179,12 +181,12 @@ int main(int argc, char *argv[]) {
         return EXIT_FAILURE;
     }
 
         return EXIT_FAILURE;
     }
 

-    // --- 2. Setup OpenMP Threads ---
+    // Setup OpenMP Threads ---

     omp_set_num_threads(thread_count);
     printf("--- Starting Sort Process ---\n");
     printf("Threads allocated by OpenMP: %d\n", omp_get_max_threads());
 
     omp_set_num_threads(thread_count);
     printf("--- Starting Sort Process ---\n");
     printf("Threads allocated by OpenMP: %d\n", omp_get_max_threads());
 

-    // --- 3. Read Data ---
+    //  Read Data

     if (!read_file(input_file)) {
         fprintf(stderr, "Failed to read data.\n");
         // Clean up data memory before exit
     if (!read_file(input_file)) {
         fprintf(stderr, "Failed to read data.\n");
         // Clean up data memory before exit


@@ -193,22 +195,30 @@ int main(int argc, char *argv[]) {
     }
     printf("Successfully read %zu elements from %s\n", data_size, input_file);
 
     }
     printf("Successfully read %zu elements from %s\n", data_size, input_file);
 

-    // --- 4. Sort Data ---
+    // Parallel Sort Data
+    struct timespec start_sort_time;
+    clock_gettime(CLOCK_MONOTONIC, &start_sort_time);

     if (data_size > 0) {
         // Execute the parallel sort
         parallel_merge_sort(0, data_size - 1);
         printf("Sorting completed successfully.\n");
     }
     if (data_size > 0) {
         // Execute the parallel sort
         parallel_merge_sort(0, data_size - 1);
         printf("Sorting completed successfully.\n");
     }

+    struct timespec end_sort_time;
+    clock_gettime(CLOCK_MONOTONIC, &end_sort_time);
+
+    // Write Results
+    double elapsed_time = (end_sort_time.tv_sec - start_sort_time.tv_sec);
+    elapsed_time += (end_sort_time.tv_sec - start_sort_time.tv_sec) / 1e9;

 
 

-    // --- 5. Write Results ---

     if (!write_file(output_file)) {
         fprintf(stderr, "Failed to write output data.\n");
         free(data);
         return EXIT_FAILURE;
     }
     printf("Sorted data written successfully to %s\n", output_file);
     if (!write_file(output_file)) {
         fprintf(stderr, "Failed to write output data.\n");
         free(data);
         return EXIT_FAILURE;
     }
     printf("Sorted data written successfully to %s\n", output_file);

+    printf("Total Elapsed Wall-Clock Time: %lf seconds\n", elapsed_time);

 
 

-    // --- 6. Cleanup ---
+    // Cleanup

     free(data);
     return EXIT_SUCCESS;
 }
     free(data);
     return EXIT_SUCCESS;
 }