MessagePassing.cpp File Reference

#include <iostream>
#include <vector>
#include <thread>
#include <functional>
#include <mutex>
#include <queue>
#include <condition_variable>
#include <atomic>
#include <utility>

Include dependency graph for MessagePassing.cpp:

Go to the source code of this file.

Classes
class	ResultQueue< T >
	A thread-safe template queue used for inter-thread communication. More...
class	ThreadPool
	Manages a collection of threads that execute tasks from a shared queue. More...
struct	IsPrimeCalculator
	A Functor (Function Object) that calculates primality. More...

Typedefs
typedef std::function< void()>	Task

Functions
int	main ()
	Orchestrates the mass calculation and collection of results.

Typedef Documentation

Task

typedef std::function<void()> Task

Definition at line 63 of file MessagePassing.cpp.

Function Documentation

main()

int main

(

void

)

Orchestrates the mass calculation and collection of results.

• Uses the hardware concurrency count to optimize the thread pool size.

Definition at line 168 of file MessagePassing.cpp.

           {
    int core_count = std::thread::hardware_concurrency();
    ThreadPool pool(core_count);
    ResultQueue<std::pair<bool, int>> results;
 
    std::cout << "System started with " << core_count << " workers.\n";
 
    // Submission: Asynchronous and non-blocking
    for (int i = 1; i <= 500; ++i) {
        IsPrimeCalculator taskObj;
        taskObj.n = i;
        taskObj.outputQueue = &results;
        pool.enqueue(taskObj);
    }
 
    // Collection: The "Inbox" processing loop
    for (int i = 1; i <= 500; ++i) {
        std::pair<bool, int> res = results.pop();
        if (res.first) {
            std::cout << "[Main] Received Result: " << res.second << " is PRIME\n";
        }
    }
 
    std::cout << "All tasks processed asynchronously!\n";
    return 0;
}

References ThreadPool::enqueue(), IsPrimeCalculator::n, IsPrimeCalculator::outputQueue, and ResultQueue< T >::pop().

Here is the call graph for this function: