Partitioning Algorithms (Pros and Cons)

Post questions here relative to DataStage Server Edition for such areas as Server job design, DS Basic, Routines, Job Sequences, etc.

Moderators: chulett, rschirm, roy

Post Reply
lacabessa
Participant
Posts: 3
Joined: Thu Jul 01, 2004 9:33 am

Partitioning Algorithms (Pros and Cons)

Post by lacabessa »

Hi,

With Datastage server (not PX), I would like to use the link partitioner to improve the performance of some of my jobs. I know that there are 4 Partitioning algorithms available for Link Partitioner (Round Robin, Random, Hash, Modulus). I will be thankful if someone tell me what are the pros and cons of each algorithm and what are the criterias that should guide our algorithm selection.

Thanks a lot

Mohamed
shawn_ramsey
Participant
Posts: 145
Joined: Fri May 02, 2003 9:59 am
Location: Seattle, Washington. USA

Re: Partitioning Algorithms (Pros and Cons)

Post by shawn_ramsey »

lacabessa wrote:Hi,

With Datastage server (not PX), I would like to use the link partitioner to improve the performance of some of my jobs. I know that there are 4 Partitioning algorithms available for Link Partitioner (Round Robin, Random, Hash, Modulus). I will be thankful if someone tell me what are the pros and cons of each algorithm and what are the criterias that should guide our algorithm selection.

Thanks a lot

Mohamed
We are using Round Robin. I played around with the various options ant they seemed to make no difference in the performance of the job.
Shawn Ramsey

"It is a mistake to think you can solve any major problems just with potatoes."
-- Douglas Adams
rasi
Participant
Posts: 464
Joined: Fri Oct 25, 2002 1:33 am
Location: Australia, Sydney

Post by rasi »

Round robin is the default algorithm. For more infomation check the manual servjdev.pdf (Page 13-3)

Thanks
Rasi
Post Reply