Overview
Examples
Screenshots
Comparisons
Applications
Download
Documentation
Tutorials
Bazaar
Status & Roadmap
FAQ
Authors & License
Forums
Funding Ultimate++
Search on this site
Search in forums












SourceForge.net Logo
Home » Developing U++ » U++ Developers corner » Funny way how NOT to speedup sorting of small arrays
Re: Funny way how NOT to speedup sorting of small arrays [message #21280 is a reply to message #19909] Mon, 11 May 2009 15:03 Go to previous messageGo to previous message
piotr5 is currently offline  piotr5
Messages: 107
Registered: November 2005
Experienced Member
I really am no expert in this sorting-thing, but I guess the real advantage of the sort-algorithm in this thread is that one can easily paralellize it. as far as I remember mmx had some possibility to sort aribatry bytes with this method in paralell: each 64-bit register can hold 8 bytes, and so comparing 2 registers will sort up to 16 bytes in a few assembler-mmx-commands. naturally larger values require more registers. of course with only 16 values starting a seperate thread (on some other processor or multicore) is quite an overhead, the same with switching from float to mmx on my amd. but if the overhead has already been taken of...
 
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Previous Topic: 1538 compilation fails
Next Topic: German language added to Docking.t of bazar/Docking
Goto Forum:
  


Current Time: Tue Aug 26 16:32:11 CEST 2025

Total time taken to generate the page: 0.06757 seconds