Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.os.linux.development.apps > #415

algorithm benchmarking

Show all headers | View raw

Hi there,

I'd like to benchmark some algorithms and while I'm an experienced coder, linux internals is definitely not my area of expertise, so I have some questions:

1. Is there a solution I'm unaware of that already does this?
2. Assuming there isn't, what would be a good way to benchmark the algorithm with:
a) an accurate picture of the peak memory usage and utime
b) a simple interface for the algorithm to implement

My current idea is to have the benchmarking tool start the algorithm implementation as a child process, then get its /proc/PID/status mem info as a baseline, then send the child a signal to tell it to start, and then wait for the algorithm to send a signal indicating it's finished, then get its procinfo again and then kill it. So the algorithm implementation would need to adhere to the signaling spec and sleep when it's done and that's it.

Is this really dumb? I obviously have no idea what I'm talking about; I'd just like to measure as close to the algorithm as possible to get accurate benchmarks, without imposing a lot of complexity on the algorithm implementer.

Thanks for any help!
Seth

Back to comp.os.linux.development.apps | Previous | Next — Next in thread | Find similar

Thread

algorithm benchmarking SethP <kaioptera@gmail.com> - 2012-02-04 15:14 -0800
  Re: algorithm benchmarking Jasen Betts <jasen@xnet.co.nz> - 2012-02-07 11:11 +0000

csiph-web