Age | Commit message (Collapse) | Author | |
---|---|---|---|
2013-04-30 | benchmarks: removed keep_m_in_n block from many rates | Josh 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-02-15 | gras: more fun with branch hints in allocator | Josh Blum | |
2013-02-10 | gras: should be set capacity for this queue | Josh Blum | |
2012-11-28 | larger theron msg pool and print on exit only | Josh Blum | |
2012-11-26 | theron message allocator, matching malloc/free | Josh Blum | |
2012-11-09 | switch to boost software license | Josh Blum | |
2012-10-28 | work on stand-alone library build | Josh Blum | |
2012-10-11 | some tweaks to the custom allocator | Josh Blum | |
2012-10-04 | make MY_ALLOCATOR_POOL_SIZE much larger, fail print debug | Josh Blum | |
2012-10-03 | make use of free alignment macros | Josh Blum | |
2012-10-02 | some minor tweaks to the allocator | Josh Blum | |
2012-10-02 | register messages, and custom allocator for performance | Josh Blum | |