summaryrefslogtreecommitdiff
path: root/benchmark
AgeCommit message (Collapse)Author
2013-05-11gras: moved query app to top levelJosh Blum
2013-04-30benchmarks: removed keep_m_in_n block from many ratesJosh Blum
This block is optimized for laziness and not performance since it returns before finishing its input based on whatever M is. This means that m=1, n=1, this block produces 1000's of outputs per input buffer, and its not really what I am looking to benchmark... ironically, keep_m_in_n crappy implementation makes for big wins on GRAS either due to lower scheduler overhead or locking contentions easier. However, its crazy number of tiny outputs really rails on the mailbox queue of the next block in the chain and causes the caching allocators to get very exited. I guess thats all fine since the block is meant to be lazy... But I cant measure the effectiveness of a typical allocator situation. Signing off...
2013-04-24gras: split many_1_to_1_blocks into two benchmarksJosh Blum
2013-04-24gras: work on benchmarks w/ theron6 supportJosh Blum
2013-04-14benchmarks: use duration based runs for resultsJosh Blum
2013-04-13gras: make the benchmarks time themselvesJosh Blum
2013-04-12gras: added suffix for benchmark resultsJosh Blum
2013-01-31benchmark: added sched compare for 2 testsJosh Blum
2013-01-20benchmark: added benchmark for rate changingJosh Blum
2013-01-14benchmark: added legend for descriptionJosh Blum
2013-01-14benchmark: added a filter test and delay testJosh Blum
2013-01-13benchmark: added stddev to bar chartsJosh Blum
2013-01-13benchmark: split into registry and runner scriptJosh Blum
2013-01-13benchmark: script now produces barplots in pdf formatJosh Blum
2012-12-29misc changes on the benchmark branchJosh Blum
2012-12-28work on benchmark stubsJosh Blum