+, -, *, /, sin etc.
Write a program that approximates the minimal
time to perform
provided you do many of the same kind. So, we are not interested in
measuring the time it takes to do one single addition, say. We would
like to know how many additions the FPU can perform per second if we use its
pipelining capabilities. It can, of course, be interesting to know
the number of clock cycles it takes to perform one single addition,
as well (i.e. the number of stages in the add-pipeline). From a
computational point of view, the throughput is more interesting,
however.
What times did you get? Gflops? Are the values
reasonable? Comments?
