|
| 1 | +/** |
| 2 | +This demonstrates a simple multithreaded sum calculation using C++11 threads. |
| 3 | +*/ |
| 4 | + |
| 5 | +#include <cassert> |
| 6 | +#include <iostream> |
| 7 | +#include <vector> |
| 8 | +#include <thread> |
| 9 | +#include <numeric> |
| 10 | +#include <stdexcept> // for exceptions |
| 11 | +#include <limits> |
| 12 | + |
| 13 | +using SumT = unsigned long long; |
| 14 | + |
| 15 | +int |
| 16 | +main(int argc, char* argv[]) |
| 17 | +{ |
| 18 | + std::size_t data_size = 1'000'000; |
| 19 | + std::size_t num_threads = 4; |
| 20 | + |
| 21 | + if (argc == 3) { |
| 22 | + try { |
| 23 | + long long ds = std::stoll(argv[1]); |
| 24 | + long long nt = std::stoll(argv[2]); |
| 25 | + if (ds < 0 || nt <= 0) { |
| 26 | + throw std::invalid_argument("data_size must be >= 0 and num_threads must be > 0"); |
| 27 | + } |
| 28 | + data_size = static_cast<std::size_t>(ds); |
| 29 | + num_threads = static_cast<std::size_t>(nt); |
| 30 | + } catch (const std::exception& e) { |
| 31 | + std::cerr << "Invalid arguments: " << e.what() << "\n" |
| 32 | + << "Usage: " << argv[0] << " <data_size> <num_threads>\n"; |
| 33 | + return 1; |
| 34 | + } |
| 35 | + } else if (argc != 1) { |
| 36 | + std::cerr << "Usage: " << argv[0] << " <data_size> <num_threads>\n"; |
| 37 | + return 1; |
| 38 | + } |
| 39 | + |
| 40 | + if (num_threads == 0) |
| 41 | + return 1; |
| 42 | + if (data_size == 0) { |
| 43 | + std::cout << "Total Sum: 0\nExpected Sum: 0\n"; |
| 44 | + return 0; |
| 45 | + } |
| 46 | + |
| 47 | + // Avoid spawning more threads than elements (optional but sensible). |
| 48 | + if (num_threads > data_size) |
| 49 | + num_threads = data_size; |
| 50 | + |
| 51 | + // Guard against int overflow in iota values. |
| 52 | + if (data_size > static_cast<std::size_t>(std::numeric_limits<int>::max())) { |
| 53 | + std::cerr << "data_size too large for vector<int> initialization via iota.\n"; |
| 54 | + return 1; |
| 55 | + } |
| 56 | + |
| 57 | + std::vector<int> data(data_size); |
| 58 | + std::iota(data.begin(), data.end(), 1); |
| 59 | + |
| 60 | + std::vector<SumT> partial_sums(num_threads, 0); |
| 61 | + std::vector<std::thread> threads; |
| 62 | + threads.reserve(num_threads); |
| 63 | + |
| 64 | + const std::size_t block_size = data_size / num_threads; |
| 65 | + |
| 66 | + for (std::size_t i = 0; i < num_threads; ++i) { |
| 67 | + const std::size_t start = i * block_size; |
| 68 | + const std::size_t end = (i == num_threads - 1) ? data_size : start + block_size; |
| 69 | + |
| 70 | + threads.emplace_back([&, i, start, end] { |
| 71 | + partial_sums[i] = std::accumulate(data.begin() + start, data.begin() + end, SumT{0}); |
| 72 | + std::cout << "Thread processing range [" << start << ", " << end |
| 73 | + << ") computed local sum: " << partial_sums[i] << "\n"; |
| 74 | + }); |
| 75 | + } |
| 76 | + |
| 77 | + for (auto& t : threads) |
| 78 | + t.join(); |
| 79 | + |
| 80 | + const SumT global_sum = std::accumulate(partial_sums.begin(), partial_sums.end(), SumT{0}); |
| 81 | + std::cout << "Total Sum: " << global_sum << "\n"; |
| 82 | + |
| 83 | + const SumT expected_sum = static_cast<SumT>(data_size) * (static_cast<SumT>(data_size) + 1) / 2; |
| 84 | + std::cout << "Expected Sum: " << expected_sum << "\n"; |
| 85 | + |
| 86 | + assert(expected_sum == global_sum); |
| 87 | + return 0; |
| 88 | +} |
0 commit comments