P. 1
Parallel and Distributed Programming on Low Latency Clusters

Parallel and Distributed Programming on Low Latency Clusters

|Views: 506|Likes:
Vittorio Giovara's master thesis is finally here! an in depth view on concurrent programming and new approaches to adapt old software to latest hardware capabilities! As usual free to use in any way as long as you quote the author and the original source.
Vittorio Giovara's master thesis is finally here! an in depth view on concurrent programming and new approaches to adapt old software to latest hardware capabilities! As usual free to use in any way as long as you quote the author and the original source.

More info:

Published by: Project Symphony Collection on Feb 07, 2010
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

03/13/2013

pdf

text

original

Thanks to the standardization of the program code, it was possible to exploit the gprof

utility, available in the gcc suite. This utility allows to obtain procedure level timing information

with reasonable resolution, as well as a complete call graph view for identifying the most

computational expensive functions.

According to the profiler, whose graph call has been reported in Figure 16, the following

functions were the most time consuming:

41

• calc intmudua

• curledge and the calling calc hdmg tet

• calc mudua

• campo effettivo

Most of the software is composed of very small routines that are called with very high

frequency, thus very difficult to optimize and to measure (in fact they are not even reported in

profiler reports); only the noted functions have an observable impact on the overall execution

time.

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->