Skip to Main Content
Green Communications and Networking
book

Green Communications and Networking

by F. Richard Yu, Xi Zhang, Victor C.M. Leung
April 2016
Intermediate to advanced content levelIntermediate to advanced
399 pages
11h 49m
English
CRC Press
Content preview from Green Communications and Networking
256 Low Power Dynamic Scheduling for Computing Systems
flow control variables γ
n
[k] in (9.46) make “bang-bang” decisions that admit
all newly arriving tasks of class n on frame k if Q
n
[k] Vw
n
, and admit none
otherwise. This property makes the algorithm naturally adaptive to situations
when the arrival rates change, as shown in the simulations of Section 9.2.4.
Note that if ˆe(0,m,I) < ˆe(c, m, I) for all c ∈{1,...,N}, m ∈M, I
[0,I
max
], so that the energy associated with processing no task is less than
the energy of processing any class c = 0, then the minimization in (9.47) will
never select a class c such that Q
c
[k] = 0. That is, the algorithm naturally
will never select a class for which no task is available.
9.2.3.2 Deterministic Queue Bounds ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Green Networking and Communications

Green Networking and Communications

Shafiullah Khan, Jaime Lloret Mauri
Green Communications

Green Communications

Jinsong Wu, Sundeep Rangan, Honggang Zhang

Publisher Resources

ISBN: 9781439899144