Results 1  10
of
127,205
Polynomial Time Algorithms for Minimum Energy Scheduling
, 908
"... The aim of power management policies is to reduce the amount of energy consumed by computer systems while maintaining satisfactory level of performance. One common method for saving energy is to simply suspend the system during the idle times. No energy is consumed in the suspend mode. However, the ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
in polynomial time. We solve this problem in positive, by providing an O(n5)time algorithm. In addition we provide an O(n4)time algorithm for computing the minimum energy schedule when all jobs have unit length. 1
Faster algorithms for minimumenergy scheduling of wireless data transmissions
 In Proc. Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks
, 2003
"... This paper considers the problem of minimizing the energy used in transmitting a given sequence of packets with specified completion deadlines from a node in a wireless packet network. The packets have to to be transmitted in firstinfirstout order. Packets can be destined to different receivers. ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
. The channel conditions to each receiver (and so the energy per bit needed) can be different and assumed to be known. An offline algorithm for the case where all the packets have a common completion deadline was presented in [3, 4], and was used as the basis for an online scheduling algorithm. In this paper
Minimum Energy Scheduling in MultiHop Wireless Networks with Retransmissions
"... rithm [1]–[4], has received much attention as a viable solution for dynamic link scheduling in multihop wireless networks. The basic principle of the MaxWeight algorithm is to select a set of interferencefree links with the maximum overall link weights in the network, where the link weight is dete ..."
Abstract
 Add to MetaCart
networks such as wireless sensor networks. In this paper, we propose a minimum energy scheduling (MES) algorithm for multihop wireless networks with stochastic traffic arrivals and timevarying channel conditions. We show that our algorithm is energy optimal in the sense that the proposed MES algorithm
A scheduling model for reduced CPU energy
 ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE
, 1995
"... The energy usage of computer systems is becoming an important consideration, especially for batteryoperated systems. Various methods for reducing energy consumption have been investigated, both at the circuit level and at the operating systems level. In this paper, we propose a simple model of job s ..."
Abstract

Cited by 558 (3 self)
 Add to MetaCart
an offline algorithm that computes, for any set of jobs, a minimumenergy schedule. We then consider some online algorithms and their competitive performance for the power function P(s) = sp where p 3 2. It is shown that one natural heuristic, called the Average Rate heuristic, uses at most a constant
On MinimumEnergy Broadcasting
 in All Wireless Networks, in the proc. of IEEE LCN'2001
"... and topology control in wireless ad hoc networks Network wide broadcasting in Mobile Ad Hoc Networks (MANET) provides important control and route establishment functionality for a number of unicast and multicast protocols. We present an overview of the recent progress of broadcasting and multicastin ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
and multicasting in wireless ad hoc networks. We discuss two energy models that could be used for broadcast: one is nonadjustable power and one is adjustable power. If the power consumed at each node is not adjustable, minimizing the total power used by a reliable broadcast tree is equivalent to the minimum
Faulttolerant Scheduling of Realtime Parallel Tasks with Energy Efficiency on Multicore Processors
"... By exploiting parallel processing, the proposed scheduling scheme enhances energy saving capability of multicore processors for realtime tasks while satisfying deadline and fault tolerance constraints. The scheme searches for a near minimumenergy schedule within a polynomial time, because finding ..."
Abstract
 Add to MetaCart
By exploiting parallel processing, the proposed scheduling scheme enhances energy saving capability of multicore processors for realtime tasks while satisfying deadline and fault tolerance constraints. The scheme searches for a near minimumenergy schedule within a polynomial time, because finding
MinimumEnergy Link Scheduling for Emptying Wireless Networks
"... Abstract We consider a wireless network consisting of sourcedestination pairs, in which each source is required to transmit a given bit volume to its destination. The goal is for all the sources to transmit the given bit volumes, under a time constraint, so that the total transmission energy is mi ..."
Abstract
 Add to MetaCart
is minimized. Our approach is the joint optimization of link scheduling and power control for minimum energy. We show that TDMA scheduling is appropriate for this goal, in the sense that TDMA is asymptotically optimal when the time constraint approaches infinity. When the time constraint is strictly bounded
An efficient algorithm for computing optimal discrete voltage schedules
 SIAM J. on Computing
"... Abstract. We consider the problem of job scheduling on a variable voltage processor with d discrete voltage/speed levels. We give an algorithm which constructs a minimum energy schedule for n jobs in O(dn log n) time. Previous approaches solve this problem by first computing the optimal continuous ..."
Abstract

Cited by 26 (1 self)
 Add to MetaCart
Abstract. We consider the problem of job scheduling on a variable voltage processor with d discrete voltage/speed levels. We give an algorithm which constructs a minimum energy schedule for n jobs in O(dn log n) time. Previous approaches solve this problem by first computing the op
Dutycycleaware minimumenergy multicasting in wireless sensor networks
 IEEE/ACM Trans. on Networking
"... Abstract—In dutycycled wireless sensor networks, the nodes switch between active and dormant states, and each node may determine its active/dormant schedule independently. This complicates the MinimumEnergy Multicasting (MEM) problem, which has been primarily studied in alwaysactive wireless adh ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract—In dutycycled wireless sensor networks, the nodes switch between active and dormant states, and each node may determine its active/dormant schedule independently. This complicates the MinimumEnergy Multicasting (MEM) problem, which has been primarily studied in alwaysactive wireless ad
Minenergy voltage allocation for treestructured tasks
 Journal of Combinatorial Optimization
, 2006
"... Abstract. We study job scheduling on processors capable of running at variable voltage/speed to minimize energy consumption. Each job in a problem instance is specified by its arrival time and deadline, together with required number of CPU cycles. It is known that the minimum energy schedule for n j ..."
Abstract

Cited by 27 (2 self)
 Add to MetaCart
Abstract. We study job scheduling on processors capable of running at variable voltage/speed to minimize energy consumption. Each job in a problem instance is specified by its arrival time and deadline, together with required number of CPU cycles. It is known that the minimum energy schedule for n
Results 1  10
of
127,205