Sciweavers

473 search results - page 41 / 95
» Early-release fair scheduling
Sort
View
MP
2002
85views more  MP 2002»
13 years 8 months ago
From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective
We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...
Dimitris Bertsimas, Jay Sethuraman
WINET
2010
144views more  WINET 2010»
13 years 7 months ago
Cross-layer quality-driven adaptation for scheduling heterogeneous multimedia over 3G satellite networks
Wireless networks are experiencing a paradigm shift from focusing on the traditional data transfer to accommodating the rapidly increasing multimedia traffic. Hence, their schedul...
Hongfei Du, Xiaozheng Huang, Jie Liang, Jiangchuan...
SIGCOMM
2012
ACM
11 years 11 months ago
Finishing flows quickly with preemptive scheduling
Today’s data centers face extreme challenges in providing low latency. However, fair sharing, a principle commonly adopted in current congestion control protocols, is far from o...
Chi-Yao Hong, Matthew Caesar, Brighten Godfrey
TON
2010
115views more  TON 2010»
13 years 3 months ago
Feedback-Based Scheduling for Load-Balanced Two-Stage Switches
Abstract--A framework for designing feedback-based scheduling algorithms is proposed for elegantly solving the notorious packet missequencing problem of a load-balanced switch. Unl...
Bing Hu, Kwan L. Yeung
ICC
2007
IEEE
14 years 3 months ago
Achievable Sum-Rate Analysis of Practical Multiuser Scheduling Schemes with Limited Feedback
— We study the performance of fair physical layer schedulers that select a pair of orthogonal users for simultaneous transmission. The schemes rely on partial channel state infor...
Alexis A. Dowhuszko, Graciela Corral-Briones, Jyri...