On 4/30/2013 11:37 PM, Anthony Rudd wrote:
The UPT instruction would appear to be ideal for implementing search.
Unfortunately, although I found a mention to such a possible implementation in
a SHARE presentation, it was only very theoretical and because the UPT example
in the Principle of Operations is incomplete and I have not beein able to
fathom out what it does, I have not been able to implement an example.
Does anyone have such an implementation?
We use the UPT instruction, in combination with the CFC instruction, to
do in-memory sorting in our software products. Our implementation of a
hardware-assisted Tournament Tree Selection Sort "blows the doors off"
all of the software-only sort implementations we were using before.
Sorting for "free" is one of the many reasons our software performs so well.
This advance was made possible by standing on the shoulders of Mike
Stack and Tom Harper who presented about how to do this at SHARE in San
Jose. http://www.kcats.org/share/sort/slides/SortAst.pdf
--
Edward E Jaffe
Phoenix Software International, Inc
831 Parkview Drive North
El Segundo, CA 90245
http://www.phoenixsoftware.com/
----------------------------------------------------------------------
For IBM-MAIN subscribe / signoff / archive access instructions,
send email to [email protected] with the message: INFO IBM-MAIN
