[Twisted-Python] Scalability of timers

[Itamar Turner-Trauring]

There is only one select() call (or whatever) at any given time,
regardless of how many timers. Syscalls are thus O(1). Timers are stored
in sorted order. When event loop wakes up it removes timers that have
been reached, which is fast because they're sorted so when you hit one
that is still in future you can stop. So that's pretty scalable. 
-------------- next part --------------
An HTML attachment was scrubbed...
URL: </pipermail/twisted-python/attachments/20140810/7e53b5f1/attachment-0002.html>