多伦多,婚礼策划.docVIP

  • 5
  • 0
  • 约2.14万字
  • 约 24页
  • 2016-08-05 发布于贵州
  • 举报
多伦多,婚礼策划

多伦多,婚礼策划 多伦多大学李葆春教授学术报告会 时间:2014年4月4日星期五 15:00-16:30 地点:新科技楼1012 报告题目: Fair Scheduling with Multiple Resources 报告摘要: It is customary in todays cloud computing and middlebox networking environments to process packets with vastly different amounts of resources of different types (e.g., CPU and network bandwidth). Fair scheduling with multiple resources allows each flow to receive a fair share of resources based on the principle of dominant resource fairness. Existing schemes for multi-resource fair scheduling, however, are expensive to implement at high speeds. Specifically, the time complexity to schedule a packet is O(log n), where n is the number of backlogged flows. In this talk, we first present a new multi-resource fair scheduling scheme that requires only O(1) work to schedule a packet and is simple enough to implement in practice. We then improve the scheme by achieving near-perfect fairness with a low scheduling delay bounded by a small constant. To the best of our knowledge, our work represents the first multi-resource fair scheduling algorithm that is provably fair, highly efficient, and with low delays. 简历: Baochun Li received his B.Engr. degree from the Department of Computer Science an

文档评论(0)

1亿VIP精品文档

相关文档