Libtorque: Difference between revisions
| Line 131: | Line 131: | ||
** We can steal work in the case of lengthy events. | ** We can steal work in the case of lengthy events. | ||
** We must implement an event cache anyway in such cases (lengthy unboundable receipts) | ** We must implement an event cache anyway in such cases (lengthy unboundable receipts) | ||
====Some techniques from networking theory==== | |||
* We have an event queue backed by ''n'' elements, but we can artificially limit the amount filled in | |||
** Use [[TCP|TCP's]] slow-start algorithm to find balanced stasis points | |||
* Stochastic Fair Queueing is trying to solve a semi-similar problem | |||
** Use its concepts of [http://en.wikipedia.org/wiki/Pareto_efficiency Pareto frontiers] for distribution | |||
===Allocation=== | ===Allocation=== | ||
'''FIXME EXPLAIN''' | '''FIXME EXPLAIN''' | ||