Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling
暂无分享,去创建一个
[1] Sartaj Sahni,et al. Algorithms for Scheduling Independent Tasks , 1976, J. ACM.
[2] Dennis Shasha,et al. D^over: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems , 1995, SIAM J. Comput..
[3] Sudipto Guha,et al. Approximating the Throughput of Multiple Machines in Real-Time Scheduling , 2002, SIAM J. Comput..
[4] F. Spieksma. On the approximability of an interval scheduling problem , 1999 .
[5] Luca Becchetti,et al. Scheduling to minimize average stretch without migration , 2000, SODA '00.
[6] Toshihide Ibaraki,et al. A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times , 1978, Oper. Res..
[7] Hang Liu,et al. Adaptive source rate control for real‐time wireless video transmission , 1998, Mob. Networks Appl..
[8] E. L. Lawler,et al. A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs , 1991 .
[9] Mark H. Overmars. Computational geometry on a grid; an overview , 1988 .
[10] Bar-NoyAmotz,et al. A unified approach to approximating resource allocation and scheduling , 2001 .
[11] Roshdy H. M. Hafez,et al. Adaptive rate controlled, robust video communication over packet wireless networks , 1998, Mob. Networks Appl..
[12] Reuven Bar-Yehuda,et al. A unified approach to approximating resource allocation and scheduling , 2001, JACM.
[13] David K. Y. Yau,et al. Adaptive rate-controlled scheduling for multimedia applications , 1997, MULTIMEDIA '96.
[14] Michael A. Bender,et al. Flow and stretch metrics for scheduling continuous job streams , 1998, SODA '98.
[15] Sudipto Guha,et al. Approximating the throughput of multiple machines under real-time scheduling , 1999, STOC '99.
[16] Richard J. Lipton,et al. Online interval scheduling , 1994, SODA '94.
[17] Rajmohan Rajaraman,et al. Online scheduling to minimize average stretch , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).