At present, a major concern regarding data centers is their extremely high energy
consumption and carbon dioxide emissions. However, because of the over-provisioning of …

Many modern microprocessors allow the speed/frequency to be set dynamically. The
general goal is to execute a sequence of jobs on a variable-speed processor so as to …

We propose a general dual-fitting technique for analyzing online scheduling algorithms in
the unrelated machines setting where the objective function involves weighted flow-time …

A versatile scheduling problem to model a three-way tradeoff between age of information
(AoI), quality/distortion, and energy is considered. The considered problem called the age …

We consider the problem of online scheduling of jobs on unrelated machines with dynamic
speed scaling to minimize the sum of energy and weighted flow-time. We give an algorithm …

This paper describes a novel architecture of fault tolerant solid state mass memory (SSMM)
for satellite applications. Mass memories with low-latency time, high throughput, and storage …

Data and computational centres consume a large amount of energy and limited by power
density and computational capacity. As compared with the traditional distributed system and …

We consider the classical problem of minimizing the total weighted flow-time for unrelated
machines in the online non-clairvoyant setting. In this problem, a set of jobs J arrive over …

We consider preemptive online scheduling algorithms to minimize the total
weighted/unweighted flow time plus energy for speed-scalable heterogeneous …

Efficient job scheduling reduces energy consumption and enhances the performance of
machines in data centers and battery-based computing devices. Practically important online …