[Haskell-cafe] Optimizing a high-traffic network architecture
bulatz at HotPOP.com
Fri Dec 16 08:41:05 EST 2005
Friday, December 16, 2005, 3:22:46 AM, you wrote:
>> TZ> You don't have to check "every few seconds". You can determine
>> TZ> exactly how much you have to sleep - just check the timeout/
>> event with
>> TZ> the lowest ClockTime.
JR> The scenario above does account for the situation that you are
to be exact - Tomasz's variant don't work proper in this situation,
but your code (which is not use this technique) is ok
>> i repeat my thought - if you have one or several fixed waiting periods
>> (say, 1 sec, 3 sec and 1 minute), then you don't need even to sort
>> requests - just use one waking thread for each waiting period and
>> requests will be arrive already sorted. in this way, you can really
>> sleep as Tomasz suggests
JR> I do not have several fixed waiting periods, they are determined by
JR> the user.
by the user of library? by the poker player? what you exactly mean?
Bulat mailto:bulatz at HotPOP.com
More information about the Haskell-Cafe