From fac31068a2a39b5d4c7cb73acaff5f601e651646 Mon Sep 17 00:00:00 2001 From: Erika Hunhoff Date: Thu, 23 May 2024 11:28:58 -0600 Subject: [PATCH] fix typo in README of programming guide --- programming_guide/section-4/section-4a/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/programming_guide/section-4/section-4a/README.md b/programming_guide/section-4/section-4a/README.md index 507dbb375d..49d19564e1 100644 --- a/programming_guide/section-4/section-4a/README.md +++ b/programming_guide/section-4/section-4a/README.md @@ -34,7 +34,7 @@ Adding the application timer is as simple as noting a start and stop time surrou This provides us with a good baseline for how long our accelerated kernel function takes. ## Multiple iterations -A timer for a single kernel function call is a useful starting point for understanding performance but there can be a lot of variability and overhead for a single call that is smoothed out when run multiple times. In order to benchmark the steady-state kernel run time, we can add code around our kernel call to execute multiple times and capture the minimium, maximize and average time that our kernel takes. +A timer for a single kernel function call is a useful starting point for understanding performance but there can be a lot of variability and overhead for a single call that is smoothed out when run multiple times. In order to benchmark the steady-state kernel run time, we can add code around our kernel call to execute multiple times and capture the minimium, maximum, and average time that our kernel takes. In our example [test.cpp](./test.cpp), we wrap our calls within a for loop (based on `num_iter` or number of iterations).