Skip to main content

An Attempt to run Odd-Even Sorting in multi-threading

 This is an attempt to run odd-even sorting from two threads without using locks. I have used a vector and split the vector logically in two halves if the size is beyond a value (Here as an example kept size 10, that means if the vector size is more than 10, then two threads will spawn and parallelize (on multi-core) sorting on the elements of the vector container. Finally, after sorting each half by two threads, another sorting will be arranged to make it finally sorted. 

The Wiki contains the details about Odd-Even sorting. It's a comparison sorting. The below code snippet is a simple approach to odd-even sorting with multi-threading without having locks. No Extra space was allocated/used in this scenario. 

void partBySort(std::vector<int>* vec, size_t begIndex, size_t endIndex)
{
    if (begIndex == endIndex) return;

    bool isSorted = false;
    while (!isSorted)
    {
        isSorted = true;

        for (size_t i = begIndex; i <= endIndex - 1; i += 2)
        {
            if (vec->operator[](i) > vec->operator[](i + 1))
            {
                std::swap(vec->operator[](i), vec->operator[](i + 1));
                isSorted = false;
            }
        }

        for (size_t i = begIndex + 1; i <= endIndex - 1; i += 2)
        {
            if (vec->operator[](i) > vec->operator[](i + 1))
            {
                std::swap(vec->operator[](i), vec->operator[](i + 1));
                isSorted = false;
            }
        }
    }
}

int main()
{
    std::vector<int> vec = { 22, 0, 1, 7, 8, 23, 10, 9, 3, 11, 80, 12, 6, 13, 4, 21, 16, 18 };
    //if (vec.size() <= 1) return 0;

    if (vec.size() <= 10) {
        partBySort(&vec, 0, vec.size() > 0 ? vec.size() - 1 : 0);
    }
    else {
        // Creating two threads just for the demo...
        std::thread oddEvenThread[2];
        size_t midIndex = (vec.size() - 1) / 2;
        oddEvenThread[0] = std::thread(partBySort, &vec, 0, midIndex);
        oddEvenThread[1] = std::thread(partBySort, &vec, midIndex + 1, vec.size() - 1);

        oddEvenThread[0].join();
        oddEvenThread[1].join();

        // Final sort on the full array
        partBySort(&vec, 0, vec.size() - 1);
    }

    for (const auto& i : vec)
        std::cout << i << " ";

    std::cout << std::endl;
}
Labels:

Comments

Post a Comment

Popular posts from this blog

Variadic template class to add numbers recursively during compilation

 The idea of having a class to add numbers (variable parameters) during compilation time recursively. Also wanted to restrict types to a single type while sending parameters to class member function. That said, if we mix int, float and double types to add function shall result in compilation error. How do we achieve this. The below is the code which actually helps to achieve this: <code> #include < fmt/format.h > template < typename T> class MyVarSumClass{     private :         T _sum = 0 ;     public :         template < typename ... TRest>         T add(T num, TRest... nums){             static_assert (std::conjunction<std::is_same<TRest, T>...>{}); /* Assert fails                if types are different */             _sum += num;             return add(nums...); // Next parameter packs gets picked recursively         }         // Base case         T add(T num){             _sum += num;             return _sum;         } }; int main() {     My
Post a Comment
Read more

A simple approach to generate Fibonacci series via multi-threading

T his is a very simple approach taken to generate the Fibonacci series through multithreading. Here instead of a function, used a function object. The code is very simple and self-explanatory.  #include <iostream> #include <mutex> #include <thread> class Fib { public:     Fib() : _num0(1), _num1(1) {}     unsigned long operator()(); private:     unsigned long _num0, _num1;     std::mutex mu; }; unsigned long Fib::operator()() {     mu.lock(); // critical section, exclusive access to the below code by locking the mutex     unsigned long  temp = _num0;     _num0 = _num1;     _num1 = temp + _num0;     mu.unlock();     return temp; } int main() {     Fib f;          int i = 0;     unsigned long res = 0, res2= 0, res3 = 0;     std::cout << "Fibonacci series: ";     while (i <= 15) {         std::thread t1([&] { res = f(); }); // Capturing result to respective variable via lambda         std::thread t2([&] { res2 = f(); });         std::thread t3(
Post a Comment
Read more

A concept to a product (Kimidori [ 黄緑]) - Part 2

In the previous part , we have seen KIMIDORI [ 黄緑] detect if a URL is malicious. In this part, we will see the details that KIMIDORI [ 黄緑] fetches out of the URL provided. As an example, provided a safe URL, https://www.azuresys.com/, and let's see what it brings out: As we can see, the link is safe and the link is active, which means we can just click on the link to open it on IE.  Now it's time to look into the URL report (still under development):  We have URLs IP, Location, and HTTP Status code. The Report part is a sliding window, the Show Report button shows as well as hides the report. Show / Hide Report is a toggle button. Let's see if we get the same details for any bad (phishing / malicious) URL: Took an URL example from a phishing link and tested it. The tool detected it as not a good link (Screen Shot Below) & link does not activate unlike a safe URL: Now let's see the report part for more details including domain registration details: It looks like it&
Post a Comment
Read more