Online time-constrained scheduling in linear networks
暂无分享,去创建一个
[1] Dennis Shasha,et al. D^over: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems , 1995, SIAM J. Comput..
[2] Moti Yung,et al. Efficient On-Line Call Control Algorithms , 1997, J. Algorithms.
[3] Sanjoy K. Baruah,et al. On the competitiveness of on-line real-time task scheduling , 2004, Real-Time Systems.
[4] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.
[5] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[6] Jörg Liebeherr. Multimedia Networks: Issues and Challenges , 1995, Computer.
[7] Yossi Azar,et al. Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms , 1999, SODA '99.
[8] Arnold L. Rosenberg,et al. Scheduling Time-Constrained Communication in Linear Networks , 2002, SPAA '98.
[9] Rajmohan Rajaraman,et al. Time-Constrained Scheduling of Weighted Packets on Trees and Meshes , 2003, Algorithmica.
[10] Kang G. Shin,et al. A Router Architecture for Real-Time Communication in Multicomputer Networks , 1998, IEEE Trans. Computers.
[11] Richard J. Lipton,et al. Online interval scheduling , 1994, SODA '94.
[12] Joseph Naor,et al. On-line admission control and packet scheduling with interleaving , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.