Energy Optimal Scheduling on Multiprocessors with Migration

We show that the problem of finding an energy minimal schedule for execution of a collection of jobs on a multiprocessor with job migration allowed has polynomial complexity. Each job is specified by a release time, a deadline, and an amount of work to be performed. All of the processors have the sa...

Full description

Bibliographic Details

Published in:	2008 IEEE International Symposium on Parallel and Distributed Processing with Applications pp. 153 - 161
Main Authors:	Bingham, B.D., Greenstreet, M.R.
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.12.2008
Subjects:	Application software Computer science Distributed processing Energy consumption energy-aware scheduling Linear programming multiprocessor scheduling Optimal scheduling Polynomials polytime scheduling Power dissipation Processor scheduling Scheduling algorithm
ISBN:	9780769534718, 0769534716
ISSN:	2158-9178
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!