/** * app.c * STREAM Host Application Source File * */ #include #include #include #include #include #include #include #include #include #include "../support/common.h" #include "../support/timer.h" #include "../support/params.h" // Define the DPU Binary path as DPU_BINARY here #ifndef DPU_BINARY #define DPU_BINARY "./bin/dpu_code" #endif #define XSTR(x) STR(x) #define STR(x) #x // Pointer declaration static T* A; static T* B; #if defined(add) || defined(triad) static T* C; #endif static T* C2; // Create input arrays static void read_input(T* A, T* B, unsigned int nr_elements) { srand(0); printf("nr_elements\t%u\t", nr_elements); for (unsigned int i = 0; i < nr_elements; i++) { A[i] = (T) (rand()); B[i] = (T) (rand()); } } static char benchmark_name[] = #ifdef scale "SCALE" #elif add "ADD" #elif triad "TRIAD" #elif copy "COPY" #elif copyw "COPYW" #endif ; static char mem_name[] = #ifdef WRAM "WRAM" #endif #ifdef MRAM "MRAM" #endif ; // Compute output in the host #if defined(add) || defined(triad) static void stream_host(T* C, T* B, T* A, unsigned int nr_elements) { #else static void stream_host(T* C, T* A, unsigned int nr_elements) { #endif for (unsigned int i = 0; i < nr_elements; i++) { #ifdef scale C[i] = (nr_elements / NR_DPUS) * A[i]; #elif add C[i] = A[i] + B[i]; #elif triad C[i] = A[i] + (nr_elements / NR_DPUS) * B[i]; #else // copy C[i] = A[i]; #endif } } // Main of the Host Application int main(int argc, char **argv) { struct Params p = input_params(argc, argv); struct dpu_set_t dpu_set, dpu; uint32_t nr_of_dpus; // Allocate DPUs and load binary DPU_ASSERT(dpu_alloc(NR_DPUS, NULL, &dpu_set)); DPU_ASSERT(dpu_load(dpu_set, DPU_BINARY, NULL)); DPU_ASSERT(dpu_get_nr_dpus(dpu_set, &nr_of_dpus)); printf("Allocated %d DPU(s)\n", nr_of_dpus); unsigned int i = 0; double cc = 0; double cc_min = 0; const unsigned int input_size = p.exp == 0 ? p.input_size * nr_of_dpus : p.input_size; #if defined(add) || defined(triad) const unsigned int n_arrays = 3; #else const unsigned int n_arrays = 2; #endif // Input/output allocation A = malloc(input_size * sizeof(T)); B = malloc(input_size * sizeof(T)); T *bufferA = A; T *bufferB = B; #if defined(add) || defined(triad) C = malloc(input_size * sizeof(T)); T *bufferC = C; #endif C2 = malloc(input_size * sizeof(T)); // Create an input file with arbitrary data read_input(A, B, input_size); // Timer declaration Timer timer; printf("NR_TASKLETS\t%d\tBL\t%d\n", NR_TASKLETS, BL); // Loop over main kernel for(int rep = 0; rep < p.n_warmup + p.n_reps; rep++) { // Compute output on CPU (performance comparison and verification purposes) if(rep >= p.n_warmup) start(&timer, 0, 0); #if defined(add) || defined(triad) stream_host(C2, B, A, input_size); #else stream_host(C2, A, input_size); #endif if(rep >= p.n_warmup) stop(&timer, 0); //printf("Load input data\n"); if(rep >= p.n_warmup) start(&timer, 1, 0); // Input arguments const unsigned int input_size_dpu = input_size / nr_of_dpus; unsigned int kernel = 0; dpu_arguments_t input_arguments = {input_size_dpu * sizeof(T), kernel}; DPU_ASSERT(dpu_copy_to(dpu_set, "DPU_INPUT_ARGUMENTS", 0, (const void *)&input_arguments, sizeof(input_arguments))); // Copy input arrays i = 0; DPU_FOREACH (dpu_set, dpu) { DPU_ASSERT(dpu_copy_to(dpu, DPU_MRAM_HEAP_POINTER_NAME, 0, bufferA + input_size_dpu * i, input_size_dpu * sizeof(T))); #if defined(add) || defined(triad) DPU_ASSERT(dpu_copy_to(dpu, DPU_MRAM_HEAP_POINTER_NAME, input_size_dpu * sizeof(T), bufferB + input_size_dpu * i, input_size_dpu * sizeof(T))); #endif i++; } if(rep >= p.n_warmup) stop(&timer, 1); //printf("Run program on DPU(s) \n"); // Run DPU kernel if(rep >= p.n_warmup) start(&timer, 2, 0); DPU_ASSERT(dpu_launch(dpu_set, DPU_SYNCHRONOUS)); if(rep >= p.n_warmup) stop(&timer, 2); #if PRINT { unsigned int each_dpu = 0; printf("Display DPU Logs\n"); DPU_FOREACH (dpu_set, dpu) { printf("DPU#%d:\n", each_dpu); DPU_ASSERT(dpulog_read_for_dpu(dpu.dpu, stdout)); each_dpu++; } } #endif //printf("Retrieve results\n"); if(rep >= p.n_warmup) start(&timer, 3, 0); dpu_results_t results[nr_of_dpus]; i = 0; DPU_FOREACH (dpu_set, dpu) { // Copy output array #if defined(add) || defined(triad) DPU_ASSERT(dpu_copy_from(dpu, DPU_MRAM_HEAP_POINTER_NAME, 2 * input_size_dpu * sizeof(T), bufferC + input_size_dpu * i, input_size_dpu * sizeof(T))); #else DPU_ASSERT(dpu_copy_from(dpu, DPU_MRAM_HEAP_POINTER_NAME, input_size_dpu * sizeof(T), bufferB + input_size_dpu * i, input_size_dpu * sizeof(T))); #endif i++; } if(rep >= p.n_warmup) stop(&timer, 3); #if PERF i = 0; DPU_FOREACH (dpu_set, dpu) { results[i].cycles = 0; // Retrieve tasklet timings for (unsigned int each_tasklet = 0; each_tasklet < NR_TASKLETS; each_tasklet++) { dpu_results_t result; result.cycles = 0; DPU_ASSERT(dpu_copy_from(dpu, "DPU_RESULTS", each_tasklet * sizeof(dpu_results_t), &result, sizeof(dpu_results_t))); if (result.cycles > results[i].cycles) results[i].cycles = result.cycles; } i++; } #endif #if PERF uint64_t max_cycles = 0; uint64_t min_cycles = 0xFFFFFFFFFFFFFFFF; // Print performance results if(rep >= p.n_warmup){ i = 0; DPU_FOREACH(dpu_set, dpu) { if(results[i].cycles > max_cycles) max_cycles = results[i].cycles; if(results[i].cycles < min_cycles) min_cycles = results[i].cycles; i++; } cc += (double)max_cycles; cc_min += (double)min_cycles; } #endif // Check output bool status = true; for (i = 0; i < input_size; i++) { #if defined(add) || defined(triad) if(C2[i] != bufferC[i]){ #else if(C2[i] != bufferB[i]){ #endif status = false; #if PRINT #if defined(add) || defined(triad) printf("%d: %u -- %u\n", i, C2[i], bufferC[i]); #else printf("%d: %u -- %u\n", i, C2[i], bufferB[i]); #endif #endif } } if (status) { printf("[" ANSI_COLOR_GREEN "OK" ANSI_COLOR_RESET "] Outputs are equal\n"); printf("[::] n_dpus=%d n_tasklets=%d e_benchmark=%-6s e_type=%s e_mem=%s b_unroll=%d block_size_B=%d | throughput_cpu_MBps=%f throughput_pim_MBps=%f throughput_MBps=%f \n", nr_of_dpus, NR_TASKLETS, benchmark_name, XSTR(T), mem_name, UNROLL, BLOCK_SIZE, input_size * n_arrays * sizeof(T) / timer.time[0], input_size * n_arrays * sizeof(T) / timer.time[2], input_size * n_arrays * sizeof(T) / (timer.time[1] + timer.time[2] + timer.time[3])); printf("[::] n_dpus=%d n_tasklets=%d e_benchmark=%-6s e_type=%s e_mem=%s b_unroll=%d block_size_B=%d | throughput_cpu_MOpps=%f throughput_pim_MOpps=%f throughput_MOpps=%f \n", nr_of_dpus, NR_TASKLETS, benchmark_name, XSTR(T), mem_name, UNROLL, BLOCK_SIZE, input_size / timer.time[0], input_size / timer.time[2], input_size / (timer.time[1] + timer.time[2] + timer.time[3])); } else { printf("[" ANSI_COLOR_RED "ERROR" ANSI_COLOR_RESET "] Outputs differ!\n"); } } printf("DPU cycles = %g cc\n", cc / p.n_reps); // Deallocation free(A); free(B); #if defined(add) || defined(triad) free(C); #endif free(C2); DPU_ASSERT(dpu_free(dpu_set)); return 0; }