You code wouldn't even rate on the benchmark! The test hardware (Toshiba T5800 laptop, in case you missed it) doesn't support the specific graphics card you would be relying on!
I think you've misunderstood the object of the exercise. It wasn't about finding the fastest way to do something using whatever hardware was necessary. It was about comparing the relative performance of commonly used languages on a given OS (Windows) and hardware (32-bit x86) combination. And note that - aiui - C# still doesn't compare very favourably with Delphi in these benchmarks even when using "unsafe" code (i.e. "direct" memory access). From: [email protected] [mailto:[email protected]] On Behalf Of Leigh Wanstead Sent: Thursday, 2 July 2009 09:51 To: NZ Borland Developers Group - Delphi List Subject: Re: [DUG] delphi is fast-very fast Frankly speaking, I am not impressed. ;-) If you use NVIDIA cuda platform to run against gtx 280 graphics card, the performance improvement might be increased 10x to 100 x faster. I have not done that code writing for this test. But if someone on this dug list willing to pay me to write a c in cuda code, I am willing to try. ;-) I will say Delphi got advantage is just simply because Delphi using plain memory mode, and most other C#, java adds some extra work load. To run against cuda code, Delphi losing on memory access latency compare to gpu vast memory bandwidth in the card. The more data volume size will show cuda will be better than any cpu memory latency restricted code. Have a nice day Regards Leigh www.smootharm.com -----Original Message----- From: [email protected] [mailto:[email protected]]on Behalf Of Gary T. Benner Sent: Wednesday, 1 July 2009 8:41 p.m. To: [email protected] Subject: [DUG] delphi is fast-very fast HI all, Not yet Friday, but here's an interesting post re the relative speeds of Delphi to other languages such as C#, C++, Java, and PHP. http://compaspascal.blogspot.com/2009/06/delphi-is-fast-very-fast.html Here's a taste... Delphi is fast, very fast Jesper Hald and others recently did a benchmark of a certain algorithm to figure out, which was fastest. It evolved into a kind of competition to make the fastest algorithm to solve this problem:Fill a data structure with 1,000,000 random, unsorted values from 0-100 Run through this data structure 200 times, counting a) number of values = 42 b) average for all 1,000,000*200 valuesThe benchmark was run on a new T5800 Toshiba laptop running 32-bit Windows Vista. Nothing had been done to the Vista to make it faster or behave in a special way.The results were interesting, and our conclusions were: ... Gary _____ Gary Benner e-Engineer, Lecturer, and Software Developer <http://www.benner.co.nz> Gary Benner & Associates <http://www.123.net.nz> 123 Internet Limited <http://www.waiariki.ac.nz> Waiariki Institute of Technology Mob: 021 966 992 Skype: garybenner Email: [email protected] Ref#: 41006
_______________________________________________ NZ Borland Developers Group - Delphi mailing list Post: [email protected] Admin: http://delphi.org.nz/mailman/listinfo/delphi Unsubscribe: send an email to [email protected] with Subject: unsubscribe
