Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Chapter

Download BibTeX

Title

Energy-aware scheduling of jobs performed sequentially

Authors

[ 1 ] Instytut Informatyki, Wydział Informatyki, Politechnika Poznańska | [ P ] employee

Scientific discipline (Law 2.0)

[2.3] Information and communication technology

Year of publication

2017

Chapter type

chapter in monograph / paper

Publication language

english

Keywords
EN
Abstract

EN We consider a problem of energy allocation to computational jobs performed on one machine, where jobs may be performed with different speeds. An energy amount is related to a particular speed of a job, and this relation is nonlinear. The objective is to find a minimum energy allocation which guarantees that the last job in the sequence is finished before a deadline. A model of job processing, a general approach, and a heuristic algorithm are proposed in the paper.

Pages (from - to)

453 - 457

DOI

10.1109/MMAR.2017.8046870

URL

https://ieeexplore.ieee.org/document/8046870

Book

22nd International Conference on Methods and Models in Automation and Robotics MMAR 2017, Miedzyzdroje, Poland, August 28-31, 2017

Presented on

22nd International Conference on Methods and Models in Automation and Robotics, MMAR 2017, 28-31.08.2017, Międzyzdroje, Polska

Ministry points / chapter

20

Publication indexed in

WoS (15)

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.