1
1楼 bobcuer 2009-04-19 ![]() 2. divide the timers based on their expirations
3. always handling the timers in the first L2 queue
4. when one of the L2 queue is empty, move the coming timers from it’s next one
5. algorithm analysis: add and delete 1 timer: O(1), search 1 timer: O(avg(L2queue’s length))
搜索墙@2009 www.pkwall.com all rights reserved QQ:276471788 [京ICP备09111534号]
声明:本站部分数据来源于网络,仅供参考,如有版权问题,请联系我们,我们将及时删除!转载本站请注明来源
| ||||||||||||||||||||||||||||||||||||||||||||