From: Greedy scheduling of tasks with time constraints for energy-efficient cloud-computing data centers
Terminology | Definition |
---|---|
V | Total number of task types |
N | Number of task arrivals |
n _{ i } | Number of type-i task arrivals, where 0≤i≤V |
M | Number of active servers in data center |
S _{ j } | Server j, where 1≤j≤M |
B _{ i,j } | Capacity of S _{ j } to store type-i tasks |
x _{ i,j } | Number of task i assigned to S _{ j } |
μ _{ i,j } | Average processing time of type-i task by S _{ j } |
τ _{ i,j } | Average queueing delay of type-i tasks on S _{ j } |
w _{ i,j } | Queue occupancy of type-i tasks at S _{ j } |
T _{ w } | Average task response time |
X _{ j } | Schedule in which tasks are processed by S _{ j } |
ω | Weight vector |
P _{ i,j } | Power consumed by S _{ j } to process a type-i task |
E _{ i,j } | Energy consumed by S _{ j } to process a type-i task |
E | Total server energy consumption in a data center |