Scheduling Jobs on Grid Processors
暂无分享,去创建一个
[1] Joan Boyar,et al. The relative worst order ratio for online algorithms , 2007, TALG.
[2] David S. Johnson,et al. Fast Algorithms for Bin Packing , 1974, J. Comput. Syst. Sci..
[3] Joan Boyar,et al. The relative worst order ratio applied to paging , 2005, SODA '05.
[4] Joan Boyar,et al. The relative worst order ratio applied to seat reservation , 2004, TALG.
[5] D. T. Lee,et al. A simple on-line bin-packing algorithm , 1985, JACM.
[6] Guochuan Zhang,et al. A New Version of On-line Variable-sized Bin Packing , 1997, Discret. Appl. Math..
[7] Joan Boyar,et al. Scheduling Jobs on Grid Processors , 2006, SWAT.
[8] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.
[9] Anna R. Karlin,et al. Competitive snoopy caching , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[10] V. Rich. Personal communication , 1989, Nature.
[11] Joan Boyar,et al. The Relative Worst Order Ratio for On-Line Algorithms , 2003, CIAC.
[12] Ronald L. Graham,et al. Bounds on multiprocessing anomalies and related packing algorithms , 1972, AFIPS '72 (Spring).
[13] Leah Epstein,et al. Separating online scheduling algorithms with the relative worst order ratio , 2006, J. Comb. Optim..