Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines

European Journal of Operational Research

Volumn 218, Issue 1, 2012, Pages 68-75

  Roycki R ^a   Weglarz, J ^a  

^a POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Deadlines; Non linear programming; Power aware computing; Preemptable jobs; Ready times

Indexed keywords

COMPLETION TIME; CONCAVE FUNCTION; CONSTRAINED RESOURCES; DEADLINES; FEASIBLE SCHEDULE; IDENTICAL PARALLEL PROCESSORS; POWER-AWARE COMPUTING; POWER-AWARE SCHEDULING; PREEMPTABLE JOBS; PROCESSING SPEED; READY TIMES;

SCHEDULING;

PARALLEL PROCESSING SYSTEMS;

EID: 83955161111     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2011.10.017     Document Type: Article

References (15)

1. S. Albers, F. Moeller, and S. Schmelzer Speed scaling on parallel processors Proceedings of The Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures 2007 ACM New York, NY, USA 289 298 (Pubitemid 47568578)
2. N. Bansal, T. Kimbrel, and K. Pruhs Dynamic speed scaling to manage energy and temperature Lecture Notes in Computer Science 3404 2005 460 471 (Pubitemid 41241269)
3. Bansal, N.; Chan, H.L.; Lam, T.W.; Lee, L.K.; 2008. Scheduling for speed bounded processors. In: Proceedings of International Colloquium on Automata, Lanaguages and Programming (ICALP), pp. 409-420.
4. Bell, P.; Wong, W.H.; 2009. Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines, In: Proceedings of The 9th Workshop on Models and Algorithms for Planning and Scheduling Problems, pp. 44-46.
5. F.R. Boyer, H.G. Epassa, and Y. Savaria Embedded power-aware cycle by cycle variable speed processor, Computers and Digital Techniques IEE Proceedings 153/ 4 2006 283 290 (Pubitemid 44000366)
6. Bunde, D.P.; 2006. Power-aware scheduling for makespan and flow, In: Proceedings of The Eighteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, pp. 190-196. (Pubitemid 44535645)
7. Chan, H.L.; Chan, W.T.; Lam, T.W.; Lee, L.K.; Mak, K.S, Wong, P.; 2007. Energy efficient online deadline scheduling, In: Proceedings of SODA 2007, pp. 795-804.
8. S. Irani, and K. Pruhs Algorithmic problems in power management ACM SIGACT News 36/2 2005 63 76
9. J. Józefowska, M. Mika, R. Róycki, G. Waligóra, and J. Weglarz A heuristic approach to allocating the continuous resource in discrete-continuous scheduling problems to minimize the makespan Journal of Scheduling 5/6 2002 487 499
10. Nelis, V.; Goossens, J.; Navet, N.; Devillers, R.; Milojevic, D.; 2008. Power-aware real-time scheduling upon identical multiprocessor platforms. In: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing. pp. 209-216.
11. R. Róycki, and J. Weglarz Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan Annals of Operational Research 2011 10.1007/s10479-011-0957-5
12. J. Weglarz Control in resource allocation systems Foundations of Computing and Decision Sciences 5/3 1980 159 180
13. J. Weglarz Project scheduling with continuously-divisible doubly constrained resources Management Science 27/9 1981 1040 1053 (Pubitemid 12463313)
14. J. Weglarz, J. Józefowska, M. Mika, and G. Waligóra Project scheduling with finite or infinite number of activity processing modes - A survey European Journal of Operational Research 208/3 2011 177 205
15. Yao, F.; Demers, A.; Shenker, S.; 1995. A scheduling model for reduced cpu energy. In: Proceedings of IEEE Symposium on Foundations of Computer Science, p. 374.