Results 1  10
of
29
Speed scaling to manage energy and temperature
 Journal of the ACM
"... We first consider online speed scaling algorithms to minimize the energy used subject to the constraint that every job finishes by its deadline. We assume that the power required to run at speed s is P s s. We provide a tight bound on the competitive ratio of the previously proposed Optimal A ..."
Abstract

Cited by 169 (17 self)
 Add to MetaCart
(Show Context)
We first consider online speed scaling algorithms to minimize the energy used subject to the constraint that every job finishes by its deadline. We assume that the power required to run at speed s is P s s. We provide a tight bound on the competitive ratio of the previously proposed Optimal Available algorithm. This improves the best known competitive ratio by a factor of . We then introduce a new online algorithm, and show that this algorithm’s competitive ratio is at most e. This competitive ratio is significantly better and is approximately e for large . Our result is essentially tight for large . In particular, as approaches infinity, we show that any algorithm must have competitive ratio e (up to lower order terms). We then turn to the problem of dynamic speed scaling to minimize the maximum temperature that the device ever reaches, again subject to the constraint that all jobs finish by their deadlines. We assume that the device cools according to Fourier’s law. We show how to solve this problem in polynomial time, within any error bound, using the Ellipsoid algorithm. 1.
Smooth ZeroContact Angle Solutions to a ThinFilm Equation Around the Steady State
"... no. 306 ..."
(Show Context)
A geometrical version of Hardy's inequality for ...
"... The aim of this article is to prove a Hardy type inequality, concerning functions in (# for some , involving the volume of# and the distance to the boundary of # The inequality is a generalization of a recently proved inequality by M.HoffmannOstenhof, T.HoffmannOstenhof and A.Laptev [9], w ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
(Show Context)
The aim of this article is to prove a Hardy type inequality, concerning functions in (# for some , involving the volume of# and the distance to the boundary of # The inequality is a generalization of a recently proved inequality by M.HoffmannOstenhof, T.HoffmannOstenhof and A.Laptev [9], which dealt with the special case p = 2.
SHARP BOUNDS FOR mLINEAR HARDY AND HILBERT OPERATORS
"... Abstract. The precise norms of mlinear Hardy operators and mlinear Hilbert operators on Lebesgue spaces with power weights are computed. Analogous results are also obtained for Morrey spaces and central Morrey spaces. 1. ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
Abstract. The precise norms of mlinear Hardy operators and mlinear Hilbert operators on Lebesgue spaces with power weights are computed. Analogous results are also obtained for Morrey spaces and central Morrey spaces. 1.
A SHARP INTEGRAL HARDY TYPE INEQUALITY AND APPLICATIONS TO MUCKENHOUPT WEIGHTS ON R
"... ar ..."
(Show Context)
The HardyRellich Inequality for . . .
 PROC. ROY. SOC. EDINBURGH SECT. A
, 1999
"... The HardyRellich inequality given here generalizes a Hardy inequality of Davies [2], from the case of the Dirichlet Laplacian of a region\Omega ` R N to that of the higher order polyharmonic operators with Dirichlet boundary conditions. The inequality yields some immediate spectral information f ..."
Abstract
 Add to MetaCart
The HardyRellich inequality given here generalizes a Hardy inequality of Davies [2], from the case of the Dirichlet Laplacian of a region\Omega ` R N to that of the higher order polyharmonic operators with Dirichlet boundary conditions. The inequality yields some immediate spectral information for the polyharmonic operators and also bounds on the trace of the associated semigroups and resolvents.
der Rheinischen Friedrich–Wilhelms–Universität Bonn vorgelegt von Hans Knüpfer aus Heidelberg
"... Classical solutions for a thin–film equation ..."
(Show Context)