Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines

In this paper we study energy efficient deadline scheduling on multiprocessors in which the processors consumes power at a rate of sα when running at speeds, where α ≥ 2. The problem is to dispatch jobs to processors and determine the speed and jobs to run for each processor so as to complete all jo...

Full description

Saved in:
Bibliographic Details
Main Authors: Paul Bell, Prudence W.H. Wong
Format: Default Article
Published: 2015
Subjects:
Other information and computing sciences not elsewhere classified
Online algorithms
Dynamic speed scaling
Competitive analysis
Multiprocessor scheduling
Deadline scheduling
Information and Computing Sciences not elsewhere classified
Online Access:https://hdl.handle.net/2134/18803
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://hdl.handle.net/2134/18803

Similar Items