Back to Results
First PageMeta Content
Applied mathematics / Job shop scheduling / Computer science / Scaling / Online algorithm / Algorithm / Competitive analysis / Operations research / Mathematical optimization / Mathematics


Optimal speed scaling under arbitrary power functions Lachlan L.H. Andrew Adam Wierman Centre for Advanced Internet Architectures Computer Science Department Swinburne University of Technology, Australia
Add to Reading List

Document Date: 2010-04-29 23:40:45


Open Document

File Size: 109,14 KB

Share Result on Facebook

City

Seattle / /

Company

Real Time Systems / Intel / /

Currency

pence / /

Facility

Australia California Institute of Technology Ao Tang School / Advanced Internet Architectures Computer Science Department Swinburne University of Technology / /

IndustryTerm

good speed scaling algorithm / nm technologies / processor sharing systems / given speed scaling algorithm / energy consumption / offline algorithm / Energy-efficient algorithms / energy cost / Approximation algorithm / given algorithm / batch algorithm / set energy/heat budget / online dynamic speed scaling algorithms / less energy / Internet Architectures Computer Science Department Swinburne University / speed scaling algorithm / energy reduction / wireless networks / real-time systems / speed scaling algorithms / energy usage / energy / /

Organization

Australia California Institute of Technology Ao Tang School of Electrical / Swinburne University of Technology / Lachlan L.H. Andrew Adam Wierman Centre / Cornell University / /

Position

scheduling model for reduced CPU energy / scheduler / /

ProvinceOrState

Washington / /

PublishedMedium

Lecture Notes in Computer Science / /

Technology

Adam / speed scaling algorithm / speed scaling algorithms / scaling algorithm / Approximation algorithm / given algorithm / 2 offline algorithm / 90 nm technologies / batch algorithm / online dynamic speed scaling algorithms / given speed scaling algorithm / good speed scaling algorithm / /

URL

http /

SocialTag