Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.os.linux.development.apps > #417
| From | Jasen Betts <jasen@xnet.co.nz> |
|---|---|
| Newsgroups | comp.os.linux.development.apps |
| Subject | Re: algorithm benchmarking |
| Date | 2012-02-07 11:11 +0000 |
| Organization | Dis (not Dat) Organisation |
| Message-ID | <jgr0sg$d51$1@reversiblemaps.ath.cx> (permalink) |
| References | <17766052.2213.1328397289309.JavaMail.geo-discussion-forums@vbtq34> |
On 2012-02-04, SethP <kaioptera@gmail.com> wrote: > 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: > > 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'm impressed. > 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. another way would be to get the implementor to code the algorithm as a shared library and use dlopen to plug it into the test suite, this gives tighter control of the start state, and more room for verifying the result... -- ⚂⚃ 100% natural --- Posted via news://freenews.netfront.net/ - Complaints to news@netfront.net ---
Back to comp.os.linux.development.apps | Previous | Next — Previous in thread | Find similar
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