Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.programming.threads > #2598

Re: About my Parallel Sort library

From Ramine <ramine@1.1>
Newsgroups comp.programming.threads, comp.programming
Subject Re: About my Parallel Sort library
Date 2014-09-16 10:31 -0700
Organization A noiseless patient Spider
Message-ID <lv9hjr$3h5$1@dont-email.me> (permalink)
References <lv7bk3$547$1@dont-email.me>

Cross-posted to 2 groups.

Show all headers | View raw


On 9/15/2014 2:37 PM, Ramine wrote:
> Hello,
>
>
> I have to clear something about my other invention called
> Parallel Sort library that you will find here:
>
> https://sites.google.com/site/aminer68/parallel-sort-library
>
>
> As you have noticed i have implemented two libraries one
> called Parallel Quicksort that you find here:
>
> https://sites.google.com/site/aminer68/parallel-quicksort
>
>
> And i have also invented another library that is more scalable
> than my Parallel Quicksort and that is my Parallel Sort library above...
>
>
> Now you have to know why my Parallel Sort library is more scalable
> than my Parallel Quicksort...
>
>
> If you take a look at the source code of those libraries you will
> notice in my Parallel Quicksort  that you can not parallelize the
> partition procedure, so that means that there is some parts in my
> Parallel Quicksort library that are not parallizable, but in my other

I mean parallelizable, not parallizable.

> Parallel Sort library, all the parts have been parallized: the sorting


i mean parallelized, not  parallized.

> part have been parallelized and the merging part have been parallelized
> two, so that have made my Parallel Sort library more scalable than my
> Parallel Quicksort library. I have implemented a Parallel hybrid
> divide-and-conquer merge algorithm that performs 0.9-5.8 times better
> than sequential merge, on a quad-core processor, with larger arrays
> outperforming by over 5 times. Parallel processing combined with a
> hybrid algorithm approach provides a powerful high performance result.
>
>
> Hope you will be happy with my Parallel Sort library and
> all my libraries are freewares that comes with the source code
> this will allow you to learn more about parallel programming.
>
>
> You can find all my libraries here:
>
> https://sites.google.com/site/aminer68/
>
>
> Thank you,
> Amine Moulay Ramdane.
>
>
>
>
>
>
>
>
>
>
>
>
>

Back to comp.programming.threads | Previous | Next — Previous in thread | Find similar | Unroll thread


Thread

About my Parallel Sort library Ramine <ramine@1.1> - 2014-09-15 14:37 -0700
  Re: About my Parallel Sort library Ramine <ramine@1.1> - 2014-09-15 14:54 -0700
  Re: About my Parallel Sort library Ramine <ramine@1.1> - 2014-09-16 10:31 -0700

csiph-web