| To: | root@xxxxxxxxxxxxxxxxxx |
|---|---|
| Subject: | Re: [RESEND] tuning linux for high network performance? |
| From: | Nivedita Singhvi <niv@xxxxxxxxxx> |
| Date: | Wed, 23 Oct 2002 11:07:41 -0700 |
| Cc: | bert hubert <ahu@xxxxxxx>, Roy Sigurd Karlsbakk <roy@xxxxxxxxxxxxx>, "David S. Miller" <davem@xxxxxxxxxxxxx>, netdev@xxxxxxxxxxx, Kernel mailing list <linux-kernel@xxxxxxxxxxxxxxx> |
| References: | <Pine.LNX.3.95.1021023133435.14975B-100000@xxxxxxxxxxxxxxxxxx> |
| Sender: | netdev-bounce@xxxxxxxxxxx |
"Richard B. Johnson" wrote: > No. It's done over each word (short int) and the actual summation > takes place during the address calculation of the next word. This > gets you a checksum that is practically free. Yep, sorry, word, not byte. My bad. The cost is in the fact that this whole process involves loading each word of the data stream into a register. Which is why I also used to consider the checksum cost as negligible. > A 400 MHz ix86 CPU will checksum/copy at 685 megabytes per second. > It will copy at 1,549 megabytes per second. Those are megaBYTES! But then why the difference in the checksum/copy and copy? Are you saying the checksum is not costing you 864 megabytes a second?? thanks, Nivedita |
| Previous by Date: | Re: [RESEND] tuning linux for high network performance?, Richard B. Johnson |
|---|---|
| Next by Date: | [¼ºÀα¤°í].....Çѹø°¡ÀÔÆò»ýȸ¿øÀ¸·Î............, ¾ß½Ã |
| Previous by Thread: | Re: [RESEND] tuning linux for high network performance?, Richard B. Johnson |
| Next by Thread: | Re: [RESEND] tuning linux for high network performance?, Richard B. Johnson |
| Indexes: | [Date] [Thread] [Top] [All Lists] |