5,553 research outputs found
Energy-Efficient Flow Scheduling and Routing with Hard Deadlines in Data Center Networks
The power consumption of enormous network devices in data centers has emerged
as a big concern to data center operators. Despite many
traffic-engineering-based solutions, very little attention has been paid on
performance-guaranteed energy saving schemes. In this paper, we propose a novel
energy-saving model for data center networks by scheduling and routing
"deadline-constrained flows" where the transmission of every flow has to be
accomplished before a rigorous deadline, being the most critical requirement in
production data center networks. Based on speed scaling and power-down energy
saving strategies for network devices, we aim to explore the most energy
efficient way of scheduling and routing flows on the network, as well as
determining the transmission speed for every flow. We consider two general
versions of the problem. For the version of only flow scheduling where routes
of flows are pre-given, we show that it can be solved polynomially and we
develop an optimal combinatorial algorithm for it. For the version of joint
flow scheduling and routing, we prove that it is strongly NP-hard and cannot
have a Fully Polynomial-Time Approximation Scheme (FPTAS) unless P=NP. Based on
a relaxation and randomized rounding technique, we provide an efficient
approximation algorithm which can guarantee a provable performance ratio with
respect to a polynomial of the total number of flows.Comment: 11 pages, accepted by ICDCS'1
On the Estimation of Nonrandom Signal Coefficients from Jittered Samples
This paper examines the problem of estimating the parameters of a bandlimited
signal from samples corrupted by random jitter (timing noise) and additive iid
Gaussian noise, where the signal lies in the span of a finite basis. For the
presented classical estimation problem, the Cramer-Rao lower bound (CRB) is
computed, and an Expectation-Maximization (EM) algorithm approximating the
maximum likelihood (ML) estimator is developed. Simulations are performed to
study the convergence properties of the EM algorithm and compare the
performance both against the CRB and a basic linear estimator. These
simulations demonstrate that by post-processing the jittered samples with the
proposed EM algorithm, greater jitter can be tolerated, potentially reducing
on-chip ADC power consumption substantially.Comment: 11 pages, 8 figure
Data dependent energy modelling for worst case energy consumption analysis
Safely meeting Worst Case Energy Consumption (WCEC) criteria requires
accurate energy modeling of software. We investigate the impact of instruction
operand values upon energy consumption in cacheless embedded processors.
Existing instruction-level energy models typically use measurements from random
input data, providing estimates unsuitable for safe WCEC analysis.
We examine probabilistic energy distributions of instructions and propose a
model for composing instruction sequences using distributions, enabling WCEC
analysis on program basic blocks. The worst case is predicted with statistical
analysis. Further, we verify that the energy of embedded benchmarks can be
characterised as a distribution, and compare our proposed technique with other
methods of estimating energy consumption
- …