Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming.threads > #2606
| Path | csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!feeder.erje.net!eu.feeder.erje.net!newsfeed.fsmpi.rwth-aachen.de!eternal-september.org!feeder.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail |
|---|---|
| From | Ramine <ramine@1.1> |
| Newsgroups | comp.programming.threads |
| Subject | Re: My Parallel Sort algorithm |
| Date | Tue, 21 Oct 2014 13:58:12 -0700 |
| Organization | A noiseless patient Spider |
| Lines | 51 |
| Message-ID | <m266r6$ea0$6@dont-email.me> (permalink) |
| References | <m266h5$ea0$1@dont-email.me> |
| Mime-Version | 1.0 |
| Content-Type | text/plain; charset=ISO-8859-1; format=flowed |
| Content-Transfer-Encoding | 7bit |
| Injection-Date | Tue, 21 Oct 2014 17:57:58 +0000 (UTC) |
| Injection-Info | mx02.eternal-september.org; posting-host="41fe296b01197a4f21931bddc5a904d6"; logging-data="14656"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/KdyZyQh9mtongj1mI+pcQ" |
| User-Agent | Mozilla/5.0 (Windows NT 6.0; WOW64; rv:24.0) Gecko/20100101 Thunderbird/24.6.0 |
| In-Reply-To | <m266h5$ea0$1@dont-email.me> |
| Cancel-Lock | sha1:tfUD/mDkF41mEINkpyUPxMy2ma8= |
| Xref | csiph.com comp.programming.threads:2606 |
Show key headers only | View raw
On 10/21/2014 1:52 PM, Ramine wrote: > > Hello, > > > I have took a look at the following paper(it is a parallel sort algorithm): > > https://software.intel.com/en-us/articles/an-efficient-parallel-sort-algorithm > > > > I think my Parallel Sort library is also scalable and very efficient, > cause my parallel sort algorithm uses two steps: the sorting step > and the merging step, and you have to know that i have completly > parallized the sorting step and also i have completly parallelized I mean: "Parallelized" not "Parallized". > the merging step, so it makes my parallel sort algorithm very > efficient and scalable and very good, and it is better and more scalable > than my parrallel quicksort library, other than that the programming > interface of my parallel sort library is very easy to use, please tale a > look at it and you will love it, i have not wrote a paper about my new > parallel sort algorithm, but i will perhaps do it in the future, but be > confidant cause my parallel sort library is really stable now, please > take a look at it and it does come with the source code. > > > You can download my Parallel Sort library from: > > > https://sites.google.com/site/aminer68/parallel-sort-library > > > > > Thank you, > Amine Moulay Ramdane. > > > > > > > > > > >
Back to comp.programming.threads | Previous | Next — Previous in thread | Find similar | Unroll thread
My Parallel Sort algorithm Ramine <ramine@1.1> - 2014-10-21 13:52 -0700 Re: My Parallel Sort algorithm Ramine <ramine@1.1> - 2014-10-21 13:58 -0700
csiph-web