On Mon, 14 Jan 2008 08:13:47 -0800, Edward Jaffe wrote:
>
>For many years now, those of us that routinely discuss assembler
>language programming and related matters have been posting links to
>various sections in the z/Architecture Principles of Operation via the
>excellent web-based reader provid
Don Leahy wrote:
True, but at least is is equipped with the "Advanced Linguistic
Search" capability, which makes PDF a much more tolerable format.
For many years now, those of us that routinely discuss assembler
language programming and related matters have been posting links to
various se
On Jan 11, 2008 6:47 PM, Graeme Gibson <[EMAIL PROTECTED]> wrote:
> Arrrgh! Cancel that, it's just a PDF version!
>
>
> Here's SA22-7832-04 :
>
>
> http://publibz.boulder.ibm.com/cgi-bin/bookmgr_OS390/download/A2278324.pdf?DT=20060213202835&XKS=DZ9ZBK05
>
>
True, but at least is is equipped with
ner" of that round. The advantage is
> that costly key comparisons are reduced.
re:
http://www.garlic.com/~lynn/2008.html#64 Radix Partition Trees
http://www.garlic.com/~lynn/2008.html#72 Radix Partition Trees
my original comment was "for the fun of it" ... look at the mainframe
duplicate with subject provided
I do not routinely post to IBM-MAIN anymore, but I was alerted to this thread
by someone who does, and I have a generic suggestion to make.
To obtain technical information about these RPTs--- including information about
Google's own patents on certain operations
The discussion of "radix partition trees" and "radix partition sort" has been
going on for a while now, and I guess it's time to display my ignorance. glen
herrmannsfeldt's comments in
http://www.garlic.com/~lynn/2002q.html#10 below exactly match my noti
W. Kevin Kelley wrote:
You could, of course, consult Knuth...
Which I did - about ten years ago I worked on a consulting
contract for a government agency I won't name, except that they
collect money from everyone Volume 3 has a very nice
algorithm for building and updating a balanced tree.
ere few problems with
> Luther's program (other than figuring out how they worked!).
re:
http://www.garlic.com/~lynn/2008.html#65 Radix Partition Trees
a few old posts mentioning luther:
http://www.garlic.com/~lynn/98.html#19 S/360 operating systems geneaology
http://www.garlic.com/~lynn/98
I see that I screwed up and I owe Luther an apology. It should
read "...tightest assembly language programs.." There were few problems with
Luther's program (other than figuring out how they worked!).
>Rick,
>
>One of the world experts in radix partition trees is Luthe
Rick,
One of the world experts in radix partition trees is Luther Woodrum and I
suspect if you do a Google search you'll turn up some of his stuff. Luther is a
bit of a legend around Poughkeepsie, with a reputation for some of the
tightest assembly language problems you'll find anyw
Arrrgh! Cancel that, it's just a PDF version!
Here's SA22-7832-04 :
http://publibz.boulder.ibm.com/cgi-bin/bookmgr_OS390/download/A2278324.pdf?DT=20060213202835&XKS=DZ9ZBK05
Graeme.
At 05:18 PM 1/11/2008, you wrote:
Paul Gilmartin wrote:
On Thu, 10 Jan 2008 22:19:25 -0500, Anne & Lynn Wh
Here's SA22-7832-04 :
http://publibz.boulder.ibm.com/cgi-bin/bookmgr_OS390/download/A2278324.pdf?DT=20060213202835&XKS=DZ9ZBK05
Graeme.
At 05:18 PM 1/11/2008, you wrote:
Paul Gilmartin wrote:
On Thu, 10 Jan 2008 22:19:25 -0500, Anne & Lynn Wheeler wrote:
for the fun of it look at:
http://
--
The instructions used for sorting, UPT and CFC, are implemented over
radix partition trees, and the doc is in the Principles of Operation.
They are extremely fast, since both of these instructions are
implemented in millicode. However, using these
ssing runs. We
are trying to get a batch year-end process to finish before the end of the
1st quarter.
IBM Mainframe Discussion List wrote on 01/10/2008
09:38:42 PM:
> Has anyone every seen any doc on using radix partition trees? I'm
> thinking it may have been one of the "ra
Sorry, that should have been "right top area".
On Fri, 11 Jan 2008 08:47:37 -0600, Big Iron <[EMAIL PROTECTED]> wrote:
>You should be able to click on the book download icon next to the PDF
>download icon in the left top area of the page to get a copy of the book in
>.BOO format.
>
>Bill
>
>On Fr
You should be able to click on the book download icon next to the PDF
download icon in the left top area of the page to get a copy of the book in
.BOO format.
Bill
On Fri, 11 Jan 2008 08:21:35 -0600, Tom Marchant <[EMAIL PROTECTED]>
wrote:
>On Thu, 10 Jan 2008 22:28:58 -0600, Paul Gilmartin wrot
On Thu, 10 Jan 2008 22:28:58 -0600, Paul Gilmartin wrote:
>Thank you; Thank you; Thank you! A z/Architecture PoO in HTML;
>Far more usable than PDF.
>
>Of course, it's August 2003, but better than s/390. Can anyone point
>me to a newer one? (We may have it on CD-ROM, but Bookie, then, not
>HTML
Paul Gilmartin wrote:
On Thu, 10 Jan 2008 22:19:25 -0500, Anne & Lynn Wheeler wrote:
for the fun of it look at:
http://publibz.boulder.ibm.com/cgi-bin/bookmgr_OS390/BOOKS/DZ9ZR003/A.7?SHELF=DZ9ZBK03&DT=20040504121320
Thank you; Thank you; Thank you! A z/Architecture PoO in HTML;
Far m
On Thu, 10 Jan 2008 22:19:25 -0500, Anne & Lynn Wheeler wrote:
>
>for the fun of it look at:
>http://publibz.boulder.ibm.com/cgi-bin/bookmgr_OS390/BOOKS/DZ9ZR003/A.7?SHELF=DZ9ZBK03&DT=20040504121320
>
Thank you; Thank you; Thank you! A z/Architecture PoO in HTML;
Far more usable than PDF.
Of cour
Rick,
The instructions used for sorting, UPT and CFC, are implemented over
radix partition trees, and the doc is in the Principles of Operation.
They are extremely fast, since both of these instructions are
implemented in millicode. However, using these instructions is not for
the faint of heart
The following message is a courtesy copy of an article
that has been posted to bit.listserv.ibm-main as well.
[EMAIL PROTECTED] (Rick Fochtman) writes:
> Has anyone every seen any doc on using radix partition trees? I'm
> thinking it may have been one of the "rainbow"
> Has anyone every seen any doc on using radix partition trees? I'm
> thinking it may have been one of the "rainbow" books.
>
> I vaguely remember data tree structures and I've got a table search
> problem that might be the perfect application for a tree-
Has anyone every seen any doc on using radix partition trees? I'm
thinking it may have been one of the "rainbow" books.
I vaguely remember data tree structures and I've got a table search
problem that might be the perfect application for a tree-structured data
repository.
23 matches
Mail list logo
