search

rdmenezes / qmast

Automatically exported from code.google.com/p/qmast
0 stars 0 forks source link

Benchmark code to eliminate delays #3

Open GoogleCodeExporter opened 9 years ago

GoogleCodeExporter commented 9 years ago 
What steps will reproduce the problem?
1. Use the benchmarking code to test different code sections
2. Test the complete system setup

This could show:
- program running too slow
- some parts taking too long

To fix it:
- brainstorm alternatives to how code is presently implemented
- use look-up tables, which are faster than complex math
- use interrupts instead of polling

Original issue reported on code.google.com by cdmblair@gmail.com on 29 Dec 2010 at 11:25

GoogleCodeExporter commented 9 years ago

Original comment by cdmblair@gmail.com on 29 Dec 2010 at 11:27

GoogleCodeExporter commented 9 years ago

Original comment by cdmblair@gmail.com on 4 Jan 2011 at 11:09

GoogleCodeExporter commented 9 years ago

Original comment by cdmblair@gmail.com on 4 Jan 2011 at 11:17

GoogleCodeExporter commented 9 years ago 
http://qmast.wikia.com/wiki/Benchmarking_Code is the wiki link to this!

Original comment by cdmblair@gmail.com on 28 Jan 2011 at 3:59

GoogleCodeExporter commented 9 years ago 
Hi Christine, I started becnhmarking the program a little, right now I only 
have a time for the parsing function, I moved the information I posted to the 
Benchmarking Code page that you set up.

Stephen

Original comment by allgood38@gmail.com on 10 Feb 2011 at 3:32

GoogleCodeExporter commented 9 years ago 
With the delays that we've found, we know approximately how fast the code runs, 
and that it shouldnt be a huge issue as long as we plan for delays occuring 
when we execute code. Further work on this may be necessary, but not 
immediately.

Original comment by cdmblair@gmail.com on 8 Mar 2011 at 2:11