featured event
Vijay Vazirani – Matching is as Easy as the Decision Problem, in the NC Model
George B. Dantzig Auditorium - 1174 Etcheverry Hall Etcheverry Hall, Berkeley, CA, United StatesAbstract: Is matching in NC, i.e., is there a deterministic fast parallel algorithm for it? This has been an outstanding open question in TCS for over three decades, ever since the discovery of Random NC matching algorithms. Over the last five years, the TCS community has launched a relentless attack on this question, leading to…
Ziv Scully – SOAP: One Clean Analysis of All Age-Based Scheduling Policies
George B. Dantzig Auditorium - 1174 Etcheverry Hall Etcheverry Hall, Berkeley, CA, United StatesAbstract: Scheduling policies are at the heart of computer systems. The right scheduling policy can dramatically reduce response times, ensure fairness, provide class-based priority, etc., without requiring additional resources. While stochastic response time analysis (e.g. in the M/G/1 queueing model) of different scheduling policies has been the focus of many theoretical papers, results are limited…
Ziv Scully – SOAP: One Clean Analysis of All Age-Based Scheduling Policies
George B. Dantzig Auditorium - 1174 Etcheverry Hall Etcheverry Hall, Berkeley, CA, United StatesAbstract: Scheduling policies are at the heart of computer systems. The right scheduling policy can dramatically reduce response times, ensure fairness, provide class-based priority, etc., without requiring additional resources. While stochastic response time analysis (e.g. in the M/G/1 queueing model) of different scheduling policies has been the focus of many theoretical papers, results are limited…