Algorithim(heap sort , quik sort ..etc) used by Dfsort

Amit Yadav · New User Joined: 20 Sep 2007 Posts: 9 Location: PUNE

Hi All .
Could anybody explain ,

Which type of algorithim(heap sort , quik sort ..etc) is used by Dfsort .
Which type of algorithim will be good for mainframe syatem.

Anuj Dhawan · Posted: Wed Apr 22, 2009 4:22 pm

Hi,

Please elaborate your question. . . "type of algorithim" depends on "type of problem" you have in hand . . .

superk · Posted: Wed Apr 22, 2009 4:23 pm

See this previous topic.

Amit Yadav · New User Joined: 20 Sep 2007 Posts: 9 Location: PUNE

If you have to sort millions of records , and i have available SYNCSORT and DFSORT both , then how we can analyse that which will be best performance wise and how?
I have to use this in production environment.

dbzTHEdinosauer · Posted: Wed Apr 22, 2009 4:58 pm

**sigh**

different sites have different configurations.

how about testing?
and then comparing results.

both products have high volume control statements.
I would worry more about learning the control statements.

since you have both products,
maybe asking your production support personnel would be a better use of your time.

mtaylor · Posted: Wed Apr 22, 2009 6:39 pm

As noted in the cited thread, these algorithms are usually covered by patents. As far as what algorithms are 'good' for mainframes, that's a bit of a nebulous question. The distinction that should concern you is 'in memory' sort versus 'file sort' since presumable on the mainframe you'll be sorting large disk/tape datasets.

There used to be an informal competition held at super computer conferences known as Terabyte Sort in which contestants developed various sorting algorithms (usually parallel) to sort terabyte sized files. There were many academic papers published from these contests detailing the algorithms.

enrico-sorichetti · Posted: Wed Apr 22, 2009 6:45 pm

see ...

Donald Knuth, The art of Computer programming - Volume 3 ( sorting and searching )

for a theoretical approach