Grad student solves decades-long data server queue conjecture | The Ohio State University
Автор: OhioStateECE
Загружено: 2020-03-31
Просмотров: 518
Описание:
In 1993, professors Frank Kelly and C.N. Laws conjectured that in order to minimize the waiting time for data servers or grocery store lines, the threshold limit should increase logarithmically with the average number of people in the store. Ever since then, engineers, mathematicians, computer scientists, and statisticians have tried to prove it, but unsuccessfully.
Ohio State University Electrical and Computer Engineering (ECE) student, Xingyu Zhou, finally resolved the open conjecture within his published ACM Sigmetrics/IFIP Performance 2019 paper, “Heavy-traffic Delay Optimality in Pull-based Load Balancing Systems: Necessary and Sufficient Conditions,” co-authored by ECE Adjunct Assistant Professor Jian Tan and ECE Professor Ness Shroff.
Learn more: https://go.osu.edu/queuetheory
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
