Open Access
Subscription or Fee Access
Speed Scaling Scheduling of Multiprocessor Jobs with Energy Constraint and Total Completion Time Criterion
Abstract
We consider the problem of speed scaling scheduling multiprocessor jobs under the given energy budget. A multiprocessor job must be performed by more than one processor at a time. The speed of a processor may be different for different jobs. Running a job at a
lower speed is more energy efficient. However, this takes a longer time and affects the performance. Our goal is to minimize the total completion time of jobs. We analyze the complexity of both parallel and dedicated statements of the problem. Approximation and exact algorithms are proposed for various cases. In our algorithms, a sequence of jobs and their processing time are calculated at the first stage, and then a feasible solution is constructed using a greedy rule of list type.
Keywords
Disclaimer/Regarding indexing issue:
We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information. Also: DOI is paid service which provided by a third party. We never mentioned that we go for this for our any journal. However, journal have no objection if author go directly for this paid DOI service.