Online Algorithms for Non-preemptive Speed Scaling on Power-Heterogeneous Processors
暂无分享,去创建一个
[1] Evripidis Bampis,et al. From preemptive to non-preemptive speed-scaling scheduling , 2013, Discret. Appl. Math..
[2] Scott Shenker,et al. Scheduling for reduced CPU energy , 1994, OSDI '94.
[3] Evripidis Bampis. Algorithmic Issues in Energy-Efficient Computation , 2016, DOOR.
[4] F. Frances Yao,et al. A scheduling model for reduced CPU energy , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[5] Prudence W. H. Wong,et al. Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines , 2015, J. Comb. Optim..
[6] Alexander Souza,et al. The Bell Is Ringing in Speed-Scaled Multiprocessor Scheduling , 2013, Theory of Computing Systems.
[7] Evripidis Bampis,et al. Speed-Scaling with No Preemptions , 2014, ISAAC.
[8] Johann Hurink,et al. A survey of offline algorithms for energy minimization under deadline constraints , 2016, J. Sched..
[9] Evripidis Bampis,et al. Scheduling on Power-Heterogeneous Processors , 2016, LATIN.
[10] Susanne Albers,et al. On multi-processor speed scaling with migration , 2015, J. Comput. Syst. Sci..
[11] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[12] Prudence W. H. Wong,et al. Multiprocessor Speed Scaling for Jobs with Arbitrary Sizes and Deadlines , 2011, TAMC.
[13] Susanne Albers,et al. Speed scaling on parallel processors , 2007, SPAA.