Back to Results
First PageMeta Content
Mathematics / Applied mathematics / Mathematical optimization / Scheduling / Analysis of algorithms / Job shop scheduling / Online algorithm / Algorithm / Multiprocessor scheduling / Operations research / Concurrent computing / Scheduling algorithms


Algorithms for Dynamic Speed Scaling ∗
Add to Reading List

Document Date: 2011-03-11 05:00:42


Open Document

File Size: 530,75 KB

Share Result on Facebook

City

Berlin / /

Company

IBM / The New York Times / Google / SIAM Journal / M.T. Hajiaghayi A.S. / AMD / Creative Commons / Dagstuhl Publishing / Intel / /

Country

Germany / /

/

IndustryTerm

Min-energy voltage allocation / elegant online and offline algorithms / polynomial time algorithms / energy conservation / energy minimization / polynomial time offline algorithms / offline algorithm / Energy-efficient algorithms / continuous min-energy schedules / above online algorithms / online version / heterogeneous processors / consumed energy / high energy consumption / portable and battery-operated devices / Electricity costs / present algorithms / c-approximation algorithm / minimum energy scheduling / energy use / online and offline algorithms / variable voltage processors / above algorithm / online setting / fixed energy volume / identical processors / Energy optimal scheduling / energy / minimum energy schedule / online strategy / processor systems / feasible schedules minimizing energy consumption / energy consumption / dynamic speed scaling algorithms / online setting jobs / energy-efficiency / power management / energy low speeds / constant competitive algorithm / polynomial time algorithm / deterministic online algorithm / constant competitive online algorithm / low-power computing environments / incurred energy / online algorithm / randomized cBα approximation algorithm / online deadline scheduling / Energy efficient deadline scheduling / online algorithms / power-heterogeneous processors / offline dynamic power management / Parallel processors / identical parallel processors / energy volume / good online algorithms / online cost / parallel processor / Online strategies / /

Organization

German Research Foundation / National Academy of Sciences USA / /

Person

Thomas Schwentick / Susanne Albers / Christoph Dürr / Wilhelm Leibniz / Job Count / /

Position

scheduler / /

PublishedMedium

Journal of the ACM / ACM Queue / SIAM Journal on Computing / The New York Times / Theoretical Computer Science / Communications of the ACM / /

Technology

corresponding algorithm / online algorithm / above algorithm / following algorithm / c-approximation algorithm / power-heterogeneous processors / polynomial time algorithm / dynamic speed scaling algorithms / deterministic online algorithm / 1 1 10 Algorithms / proposed algorithms / above online algorithms / elegant online and offline algorithms / variable-speed processor / randomized cBα approximation algorithm / identical parallel processors / good online algorithms / offline algorithm / 2.1 Basic algorithms / online and offline algorithms / 1 1 6 Algorithms / 1 1 8 Algorithms / 1 1 4 Algorithms / 2 Algorithms / variable voltage processors / polynomial time offline algorithms / 2.2 Speed-bounded processors The algorithms / paging / polynomial time algorithms / The processor / Digital Object Identifier / two speed-bounded processors / two online algorithms / /

URL

http /

SocialTag