From 1b2e84e55a99ad46e7db519f77ec815f2598a425 Mon Sep 17 00:00:00 2001 From: William Kong Date: Wed, 29 Jan 2025 20:12:04 +0000 Subject: [PATCH] Fix minor typos in `ForkJoin.h` --- Eigen/src/ThreadPool/ForkJoin.h | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/Eigen/src/ThreadPool/ForkJoin.h b/Eigen/src/ThreadPool/ForkJoin.h index 46dac49f1..916df74e6 100644 --- a/Eigen/src/ThreadPool/ForkJoin.h +++ b/Eigen/src/ThreadPool/ForkJoin.h @@ -16,14 +16,14 @@ namespace Eigen { // ForkJoinScheduler provides implementations of various non-blocking ParallelFor algorithms for unary -// and binary parallel tasks. More specfically, the implementations follow the binary tree-based +// and binary parallel tasks. More specifically, the implementations follow the binary tree-based // algorithm from the following paper: // // Lea, D. (2000, June). A java fork/join framework. *In Proceedings of the // ACM 2000 conference on Java Grande* (pp. 36-43). // // For a given binary task function `f(i,j)` and integers `num_threads`, `granularity`, `start`, and `end`, -// the implemented parallel for algorithm schedules and excutes at most `num_threads` of the functions +// the implemented parallel for algorithm schedules and executes at most `num_threads` of the functions // from the following set in parallel (either synchronously or asynchronously): // // f(start,start+s_1), f(start+s_1,start+s_2), ..., f(start+s_n,end)