6 citations · 14 across the 8 of their papers we have counts for
Showing cs.PFShow all
3 papers · 1 filter
cs.PF2023★ 6 cited
Performance of the Gittins Policy in the G/G/1 and G/G/k, With and Without Setup Times
Yige Hong, Ziv Scully
How should we schedule jobs to minimize mean queue length? In the preemptive M/G/1 queue, we know the optimal policy is the Gittins policy, which uses any available information abo…
cs.PF2022★ 3 cited
Near-Optimal Stochastic Bin-Packing in Large Service Systems with Time-Varying Item Sizes
Yige Hong, Qiaomin Xie, Weina Wang
In modern computing systems, jobs' resource requirements often vary over time. Accounting for this temporal variability during job scheduling is essential for meeting performance g…
cs.PF2021★ 1 cited
Sharp Waiting-Time Bounds for Multiserver Jobs
Yige Hong, Weina Wang
Multiserver jobs, which are jobs that occupy multiple servers simultaneously during service, are prevalent in today's computing clusters. But little is known about the delay perfor…