Please use this identifier to cite or link to this item:
http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/14735| Title: | Complexity of a problem of energy efficient real-time task scheduling on a multicore processor |
| Authors: | Mishra, Abhishek |
| Keywords: | Computer Science Multicore Processor Dynamic Voltage Scaling |
| Issue Date: | Jun-2014 |
| Publisher: | Wiley |
| Abstract: | The problem of scheduling independent tasks with a common deadline for a multicore processor is investigated. The speed of cores can be varied (from a finite set of core speeds) using software controlled Dynamic Voltage Scaling. The energy consumption is to be minimized. This problem was called the Energy Efficient Task Scheduling Problem (EETSP) in a previous work in which a Monte Carlo algorithm was proposed for solving it. This work investigates the complexity of the EETSP problem. The EETSP problem is proved to be NP-Complete. Under the assumption of urn:x-wiley:10762787:media:cplx21561:cplx21561-math-0001, the EETSP problem is also proved to be inapproximable |
| URI: | https://onlinelibrary.wiley.com/doi/full/10.1002/cplx.21561 http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/14735 |
| Appears in Collections: | Department of Computer Science and Information Systems |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.