A note on multiprocessor speed scaling with precedence constraints
暂无分享,去创建一个
[1] Ronald L. Graham,et al. Bounds for certain multiprocessing anomalies , 1966 .
[2] Michael A. Bender,et al. An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines , 1998, IPCO.
[3] David P. Bunde. Power-aware scheduling for makespan and flow , 2006, SPAA '06.
[4] Ola Svensson,et al. Conditional hardness of precedence constrained scheduling on identical machines , 2010, STOC '10.
[5] Kirk Pruhs,et al. Speed Scaling of Tasks with Precedence Constraints , 2005, Theory of Computing Systems.
[6] Erik D. Demaine,et al. Energy-Efficient Algorithms , 2016, ITCS.
[7] Fabián A. Chudak,et al. Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds , 1997, SODA '97.
[8] F. Frances Yao,et al. A scheduling model for reduced CPU energy , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[9] David B. Shmoys,et al. Improved approximation algorithms for shop scheduling problems , 1991, SODA '91.
[10] Lachlan L. H. Andrew,et al. Power-Aware Speed Scaling in Processor Sharing Systems , 2009, IEEE INFOCOM 2009.
[11] Susanne Albers,et al. Algorithms for Dynamic Speed Scaling , 2011, STACS.