January 19th, 2012, 7:46 pm
QuoteA number of years ago, we talked about creating a buffered serial RNG that created and buffered RNs for use by parallel path/price calculators. One processor core would spend up to 100% of it's time creating RNs and storing them. A second dispatch process would deal the buffered FIFO buffer of RNs to the N-1 cores that consume RNs. As long as one core can create enough RNs to feed N-1 cores of path, price, and aggregation calculations, then the approach would be efficient. And here is the prototype; at some stage we can monitor arrival and service rates and get a finely-tuned load balance.
Last edited by
Cuchulainn on January 18th, 2012, 11:00 pm, edited 1 time in total.