> As many recent studies have shown, interpreted languages can bring
> identical or acceptable performance levels for many operations when
> suitable algorithms are employed.
I believe that Wikipedia would term the above paragraph as "weasel words",
and put the applicable notice on the article.
I also happen to spend a lot of my time writing full, self-contained programs in
the AWK programming language. This language just so happens to be interpreted.
"AWK was born on a slow machine with a 4MHz CPU and 16KB of memory", wrote
Aho, Kernighan and Weinberger in their book on the language, so you can perhaps
imagine the speed of execution one can obtain from such a product on modern
systems whose processors have GigaHertz tact frequencies and hundreds of
gigabytes
of memory, and indeed, the speed of execution of my programs is very great.
But when I use awka, the AWK to ANSI C compiler, and then use hp's or Sun's
compilers with optimizations, I regularly get 100% performance improvements,
sometimes more. Obviously, the algorithm is the same.
There is a lesson to be learned from that, too.
_________________________________________________________________
Windows Live: Friends get your Flickr, Yelp, and Digg updates when they e-mail
you.
http://www.microsoft.com/middleeast/windows/windowslive/see-it-in-action/social-network-basics.aspx?ocid=PID23461::T:WLMTAGL:ON:WL:en-xm:SI_SB_3:092010_______________________________________________
opensolaris-discuss mailing list
[email protected]
