Battery optimization vs energy optimization: Which to choose and when?

Size: px
Start display at page:

Download "Battery optimization vs energy optimization: Which to choose and when?"

Transcription

1 Battery optimization vs energy optimization: Which to choose and when? Ravishankar Rao and Sarma Vrudhula NSF Center for Low Power Electronics Arizona State University Tempe, AZ {ravirao, Naehyuck Chang School of Computer Science and Engineering Seoul National University Seoul, Korea Abstract Batteries are non-ideal energy sources minimizing the energy consumption of a battery-powered system is not equivalent to maximizing its battery life. We propose an alternative interpretation of a previously proposed battery model, which indicates that the deviation from ideal behavior is due to the buildup of unavailable charge during the discharge process. Previously, battery-aware task scheduling algorithms and power management policies have been developed, which try to reduce the unavailable charge at the end of a given workload. However, they do not account for the occurrence of rest periods (user enforced, naturally occurring, or due to finite load horizon), which are present in a variety of workloads. We first obtain an analytical bound on the recovery time of a battery as a function of the extent of recovery. Then, we shown that the effect of the rest periods is to reduce the improvement of battery-charge optimizing techniques over traditional energy-optimizing techniques. Under certain conditions, the policy that only minimizes energy consumption can actually achieve a longer battery lifetime than a battery-aware policy. A formal criterion based on the recovery time is proposed to choose between a candidate battery-aware policy and a candidate energy-aware policy. We also model the battery discharge process as a Linear Time Invariant system and obtain the frequency response of a battery. This is then used to study the effect of task granularity on the improvement achieved by battery-aware task scheduling. It was observed that the response time of typical batteries are of the order of seconds to several minutes. This, along with the charge recovery effect, was seen to cause battery-aware task scheduling methods to become ineffective for both very fine-grained (less than ms) and very coarse-grained (greater than 3 min) task granularities. I. INTRODUCTION To simplify the modeling effort for battery-powered systems, the battery is often assumed to be an ideal voltage source with a finite charge capacity and a constant voltage profile. Let us denote the charge delivered to the load and the charge available at a time t as l(t) and a(t) respectively, and the capacity of the battery as α. Such a battery exhibits two important characteristics: (i) the energy delivered to the load over a given interval is proportional to the charge delivered, and (ii) a(t) = α l(t). While (i) is still approximately true for a real battery, (ii) is not. A quantity called the unavailable charge can be defined as follows: u(t) = α l(t) a(t), which is responsible for the deviation from ideal behavior. This is a non-negative quantity and depends on several parameters external to the battery like the temperature, the past discharge rate profile, and the number of chargerecharge cycles [2], [3]. High-level battery models [4] [8] have been developed that capture battery discharge behavior with reasonable accuracy, but are less computationally intensive and easier to configure than detailed physical models [9]. Such models have been used to develop batteryaware heuristics for task scheduling [7], [] [2], voltage scaling [7], [], and discharge current shaping [6], [3] [5]. Such heuristics (henceforth collectively be referred to as battery-charge optimization techniques and denoted by B) are aimed at improving the battery lifetime when compared to traditional energy optimization techniques (henceforth denoted by E) that ignore battery effects like the rate capacity effect. However, none of the workload models used in these works account for the occurrence of rest periods that occur commonly in a wide range of portable battery-operated systems. The effect of these rest periods is to cause the lifetime of the B-policies to come closer, or even become worse than that of the corresponding E-policies. A. Motivation: The effect of rest periods Rest periods that occur in workloads are mainly of three types: User-enforced rest periods: In many portable devices like PDAs, laptops, cell phones, etc., the user can pause or turn off the device, at any instant, thus forcibly introducing rest periods in the workload. Finite horizon workloads: A finite horizon workload is essentially has an infinitely long rest period at its end. Natural pauses in workloads: In devices like environment monitoring sensor networks, remote sensing satellites, etc., the workload, by design, consists of periodic peaks separated by idle durations. Unlike energy minimization, battery-charge optimization requires the specification of a time at which the battery charge is to be minimized (see Section II). For finite horizon workloads, this is usually the time by which all tasks are complete [7]. As user-enforced rest periods are very hard to predict, they cause the actual completion time of tasks to vary wildly. For example, a B-type algorithm that maximizes available charge at the end of a movie (by assuming continuous playback) may not be optimal any more if the user interrupts the movie in between for 2 minutes. While E only optimizes the actual charge lost, while B optimizes the sum of the actual charge lost and the unavailable charge. But, in trying to minimize the latter sum charge, B could end up losing more actual charge than E. If the duration of the rest period is sufficiently large, the unavailable charge for both policies tends to zero. This reduces the potential improvements in the battery lifetime of B over E. Further, unless B has the same actual charge lost at E, we show that there exists a finite rest period duration that can cause E to be optimal, both in terms of actual charge lost and available charge. Though the natural pauses in workloads may be predictable, they are still uncontrollable. Our results suggest that rest period durations larger than 3 minutes are sufficiently long to cause B-type policies to have little or no (less than 5%) improvement in terms of available charge, over E-type policies (see Section IV-A). Further, if a battery is not dead at the end of a finite horizon workload, it has a very large rest period to recover charge, so that B-type policies are not required. However the earlier works on battery-aware task scheduling/scaling for finite horizon workloads [7], [], [2] do not account for such

2 rest periods at the end of the workload. One can verify that the three types of rest periods mentioned above are not contrived examples, but are frequently found in most workloads for battery-powered systems. This makes it very important to develop an objective criterion for choosing between B-type and E-type policies. B. Main contributions The following are the main contributions of this paper: An alternative interpretation of the battery model proposed by Rakhmatov et al. [7] is presented. Our representation relates the battery cost function σ that was proposed in [7] to the charge delivered to the load l, and the unavailable charge u, and provides valuable insight into the battery discharge process. This interpretation allowed us to analyze the relationship between the proportion of unavailable charge recovered and the time taken to recover. This analysis resulted in an analytical upper bound on the recovery time of a battery. Based on this bound, a criterion is proposed for choosing whether to use an energy-optimal or a battery-charge optimal policy, depending on the duration of the forced rest periods. The battery model from [7] is recast as a convolution between the load and a Linear Time Invariant (LTI) system, allowing us to obtain the frequency response of a battery as a function of its parameters. The frequency response of the battery was used to obtain the range of response times of typical batteries, and their sensitivity to the granularity of battery-aware task scheduling. While the aim of our work was to develop criteria for using batteryaware strategies, we believe the (i) charge-component description of the discharge process, (ii) the recovery time expression for a battery, and the (iii) frequency domain representation of the battery, will have uses beyond the original purpose. C. Organization Section II provides a high-level view of the battery discharge behavior in terms of the lost, available and unavailable charge components. In section III, the recovery time of a battery is expressed in terms of the battery parameters. In section IV, a criterion for choosing between an energy-aware and a battery-charge aware policy is proposed, which is based on the relative improvements of the two policies in terms of actual and apparent charges lost. Section V derives the frequency response characteristic of a battery. This is used to obtain the range of response times for practical batteries and explore the effect of task granularity on battery-charge aware task scheduling. Based on these analyzes, a recommendation of when to use battery-aware policies is presented in Section VI, and Section VII concludes the paper. II. CHARGE COMPONENT INTERPRETATION OF THE BATTERY DISCHARGE PROCESS Rakhmatov et al. [7] proposed a high-level model of the battery discharge process, which was obtained by solving the electrochemical and diffusion equations for a simple one-dimensional cell model. It provides the following analytical relationship between the load current profile i(t), the battery lifetime L, and two experimentally determined battery parameters, α and β: Z L Z! L X α = i(t) dt + i(t) 2 e β2 m 2 (L t) dt. () Time l(t) u(t) σ(t) a(t) t = α < t < L l(t) u(t) l(t) + u(t) α σ(t) t = L l(l) u(l) l(l) + u(l) = α TABLE I RELATIONSHIP BETWEEN DIFFERENT CHARGE COMPONENTS. A. The apparent charge lost Rakhmatov et al. also defined a battery cost function σ(t) Z t Z! t X σ(t) = i(τ) dτ+ i(τ) 2 e β2 m 2 (t τ) dτ. (2) {z } {z } l(t) u(t) They used this cost function to develop task scheduling and voltage scaling algorithms that tried to minimize σ(t ), where T was the deadline by which the given set of tasks was to be completed. This cost function has another useful interpretation, as we note below. The first term in (2) is simply the actual charge lost till time t, which we denote as before as l(t). The second term is clearly non-negative, or σ(t) l(t). From (2), σ() =. Further, comparing (2) and (), we have σ(l) = α. The quantity σ then, is initially zero, is always no less than the actual charge lost, and equals the battery parameter α when the battery is dead. Suppose now that β =, so that the second term in () and (2) vanishes. Then, we have α = l(l), so that α is the maximum charge delivered by an ideal battery, i.e. α is the battery s full charge capacity. For a battery with finite β then, the battery behaves as though it has lost an amount of charge σ(t) that is greater than what it actually lost to the load l(t). Just like an ideal battery dies when the actual charge lost exceeds its capacity, a real battery dies when its apparent charge lost σ(t) exceeds its capacity. B. Available and unavailable charge The term, available charge (or available capacity), which is commonly used in battery literature can now be expressed in terms of the apparent charge lost as a(t) = α σ(t). Let us denote the second term in (2) as u(t). It is clear that this term causes the available charge to be smaller than its ideal value of α l(t). Hence, this term can be interpreted as the unavailable charge at time t. The unavailable charge u(t) for a given load profile is a monotonically decreasing function of the β parameter, a small value of β (around. min /2 ) causes significant build up of unavailable charge, while at larger β values (around min /2 ), this build up is negligible compared to the actual charge lost. The physical reason for this unavailable charge is described in [7]. The interpretation of the battery discharge behavior in terms of available and bound charges was also described in Manwell et al s kinetic battery model [4]. But, we chose the model in [7] as the relationship between the load current and the lifetime in it was more intuitive and required only two battery parameters instead of three. The relations between the various charge components are summarized in Table I. We also want to point out that the unavailable charge u (and hence σ and a) of a battery cannot be directly measured. Hence, we are unable to experimentally verify the behavior of the quantities that we define later in this paper as they are directly based on the notion of the unavailable charge. However, all our results are a consequence of the properties of the battery model proposed in [7], which was verified with actual measurements and DUALFOIL [9] simulations. C. Battery discharge behavior The battery discharge behavior can be interpreted in terms of movement of charge between the different charge components. This is

3 Fig. 2. Charge (ma min) Fig x 4 a(t) u(t) α l(t) Time (min) Battery dead A plot of u(t), l(t) and a(t) for an example load profile. u u u a a a l l l α (a) Fully Charged (b) Partly discharged (c) Partly recovered (d) Fully discharged An illustration of charge movement during discharge and recovery. best illustrated with an example. Figure (b) shows the plots (obtained from (2)) of the l(t), u(t) and a(t) curves for an example load profile 8 >< 3 ma, min t 3 min, i(t) = ma, 3 min t 5 min, >: 5 ma, 5 min t 75 min, which discharges a battery with α = 4,35 ma.min and β =.273 min /2. Figure 2 shows a graphical representation of the charge movement. At time t =, the battery is fully charged (Figure 2(a)), or the entire charge is available (a() = α), and no charge has been lost (l() = ) or been made unavailable (u() = ). A constant current load of 3 ma is then applied for 3 min. During this period, the available charge is depleted in two ways: it is delivered to the load as l(t) and is permanently lost, it is locked up within the battery as u(t) and can be recovered (Figure 2(b)). At time t = 3 min, the load is turned off for a duration of 2 min. During this period, the battery recovers charge, i.e. the unavailable charge gradually becomes available (Figure 2(c)). At time t = 5 min, a constant current of 5 ma is applied till the battery is discharged at t = 73 min. At this instant, all the available charge at time t = 5 min has been either lost to the load or become unavailable (Figure 2(d)). III. THE RECOVERY TIME A. Recovery time of a constant load profile Consider a constant load profile given (I, ) define as i(t) = I t [, ) and otherwise. The unavailable charge in an (α,β) battery due to this load profile can be obtained by integrating the second term in (2) and is given by ( I F(β,,t,t), t <, u(t) = I F(β,,,t), t, where f is the battery function and is is defined as X e β2 m 2 (t t f ) e β2 m 2 (t t i ) F(β,t i,t f,t) = 2 β 2 m 2, for t i t f < t. It can be shown that F(β,,t,t) is monotonically increasing for all t > and that F(β,,,t) is monotonically decreasing for t. The maximum unavailable charge u max of a constant load profile (I, ) is defined as the unavailable charge at t = +. The recovery time, t r (ε), for a constant load profile (I, ) is defined as that additional time after by which the unavailable charge u( + t r ) has reduced to a fraction ε of the maximum unavailable charge u max = u( + ), or I F(β,,, +t r ) = ε I F(β,,, + ), X e β2 m 2 t r e β2 m 2 X e β2 m 2 β 2 m 2 = ε β 2 m 2. (3) From the above equation, we note that the recovery time of a constant load profile is independent of the magnitude of the load current. B. Upper bound on the recovery time It is difficult to obtain a closed form expression for t r (ε) from the above equation. However, noting that X e β2 t r e β2 m 2 X e β2 m 2 t r e β2 m 2 β 2 m 2 β 2 m 2, and using (3), an upper bound on t r can be obtained as t r log(ε). (4) β2 However, the above bound is not tight. In most practical cases, we are interested in finding the time taken to recover at least 6% of the unavailable charge. This corresponds to a range of ε <.4. A slight modification to (4) was found empirically to provide a much tighter upper bound, t r (ε) in this range: C. Simulation results t r t r = log(.5ε), ε <.4 (5) β2 Figure 3 shows the recovery time t r (ε) and its upper bound t r (ε) for three different values of ε for a battery with β =.273 min /2. It can be seen that the actual recovery time increases with load duration, but tends toward the upper bound for larger. Figure 4 shows the recovery time as a function of the battery parameter β for a constant current load of duration 3 minutes. It can be seen that for a battery with a low β value, the recovery time t r (5%) is of the order of ten to hundred minutes, while for batteries closer to ideal behavior, the recovery is only of the order of minutes. D. Recovery time of an arbitrary load profile Without loss of generality, we can assume that an arbitrary load profile consists of a series of N load steps (I, ),(I 2, 2 ),..., (I N, N ), where I k, k, and t k are the magnitude, duration and start time, respectively, of the k th load step. The recovery time t r (ε) for such a load profile is defined as before as the additional time required

4 Recovery time (min) t r (ε =.) t r (ε =.) t r (ε =.5) t r (ε =.) t r (ε =.) t r (ε =.5)! 2 3 Load duration (min) Fig. 3. Recovery time (min) 3 2 Dependence of recovery time on load duration Actual recovery time Upper bound.5.5 Battery parameter β (min /2 ) Fig. 4. The recovery time t r (ε = 5%) for a load (I = 5 ma, = 3 min), for different values of β. after the end of the load profile (i.e. at time ), for the unavailable charge to reduce to a fraction ε of the maximum unavailable charge, P u(t r + ) Nk= I k F(β,t k,t k + k,t r + ) = P u( ) Nk= = ε. (6) I k F(β,t k,t k + k, ) Now, the contribution of the k th load segment to the total unavailable charge is u k (t) = I k F(β,t k,t k + k,t), t > t k + k. (7) u k can be considered as the contribution of load segment k to the total unavailable charge u of the load profile. Let the quantity t r,k be given by u k (t r,k + ) = εu k ( ), or P h i e β 2 m 2 β2 m 2 (t r,k + t k k ) e β2 m 2 (t r,k + t k ) P ˆe β 2 m 2 ( t k k β 2 m ) = ε. (8) e 2 β2 m 2 ( t k ) Again, this equation is difficult to solve for t r,k in closed form, but by noting that exp` β 2 m 2 t exp` β 2 t for all m =,2,..., we get t r,k log(ε) = t β 2 r, the same upper bound we got before for a constant load profile. Then, from (6) and (7), we have NX NX u k (t r + ) = ε u k ( ). (9) k= As u k ( t r + ) εu k ( ), it follows that k= NX u k ( t r + ) = u( t r + ) εu( ), () k= so that the upper bound on the recovery time of an arbitrary load profile is the same as that for a constant load profile. The same correction for ε <.4 can again be made here. IV. ENERGY OPTIMIZATION VS BATTERY-CHARGE OPTIMIZATION Consider a task set that needs to be scheduled in such a way that all tasks complete by a given deadline T with the objective being to minimize the apparent charge lost at T. The scheduling problem can be made arbitrarily complex by allowing task preemption, idle period insertion, voltage/clock scaling, disk drive speed control, etc. For brevity, we refer to them collectively as scheduling/scaling policies. Suppose now that a rest period of unpredictable duration r was forcibly inserted at the end of the task set by the user. It is shown later in this section that if the r is sufficiently long, it would have been better to optimize the actual charge lost l(t ) instead of the apparent charge σ(t ). We are interested then, in answering the following question: In order to maximize the battery lifetime of a system where forced rest periods can occur, should the objective of task scheduling be to minimize the apparent charge lost (a battery-aware policy B) or to minimize the actual charge lost (an energy-aware policy E)? Section IV-B presents a criterion to answer this question. The subscripts B and E will be used to denote the charge components of the respective policies. As B is optimal w.r.t. σ(t ), we must have σ B (T ) σ E (T ). Similarly, as E is optimal w.r.t. l(t ), we have l E (T ) l B (T ). Let t r (ε) be the recovery time of the battery. Further, we have from (2) that σ B (T +t r (ε)) = l B (T +t r (ε)) + u B (T +t r (ε)). () As no charge is delivered to the load during the rest period [T,T + t r (ε)], l B (T +t r (ε)) = l B (T ). Also, from the definition of the recovery time, we have that u B (T +t r (ε)) = εu B (T ), so that σ B (T +t r (ε)) = l B (T ) + εu B (T ), (2) and similarly, σ E (T +t r (ε)) = l E (T ) + εu E (T ). (3) Let us denote the improvement in apparent charge lost of B over E as σ(t) = σ E (t) σ B (t). Also, let σ T = σ E (T ) σ B (T ), and l T = l B (T ) l E (T ). The quantities σ T and l T can be considered as metrics for evaluating the effectiveness of a battery-aware policy as they quantify how much better (in terms of σ) B can be than E, and at what cost (in terms of l). A. Effect of rest periods on σ We have σ(t +t r (ε)) = l T + ε(u E (T ) u B (T )) Substituting ε = in the above equation, we get u E (T ) u B (T ) = σ T + l T, so that σ(t +t r (ε)) = ε( σ T + l T ) l T. (4) Clearly, as ε decreases (or as the rest period duration increases), so does the improvement of the B policy over the E policy. From Figure 4, the recovery time for a given recovery ratio decreases monotonically with the battery parameter β, so that batteries with larger β will show smaller σ improvements for the same rest period. B. The rest period length criterion If l T >, a sufficiently large rest period can cause σ to flip signs, causing the B policy to actually be worse than the E policy, both in terms of σ and l. In other words, the optimality of B w.r.t. σ(t ) is reversed at a time T +t r (ε), for some ε >. Let us define the

5 Load current i(t) (ma) (a) Charge (ma min) (b) σ B (t) i B (t) σ E (t) l E (t) l B (t) T i E (t) Time t (min) 3.5 x σ t r (ε ) Reversal of Optimality Time (min) Fig. 5. A task scheduling example that illustrates the reversal of optimality and schedule selection criterion. critical recovery ratio ε as that value of ε at which σ(t +t r (ε) =. Then, using (4), ε is obtained as ε = l + σ T / l T. (5) Thus, if it is known in advance that a forced rest period of length r > t r (ε ) is inserted at t = T, applying policy E during [,T ) is optimal w.r.t. σ(t + r ), otherwise, using policy B is optimal. It is intuitively satisfying that the criterion for choosing between them involves the ratio of the corresponding metrics σ T and l T. If l T = and σ T >, then ε =, and hence t r =. This means that if B can achieve an improvement in apparent charge lost over E without any reduction in the actual charge lost, such a policy is always optimal even in the presence of forced rest periods. Section V-C shows an example of such a form of battery optimization. In other words, to avoid a reversal of optimality due to rest periods, the battery-charge σ should be optimized with a constraint that the energy consumption be no worse than that of an energy optimal policy. Further, if l T =, it follows that σ(t + t r (ε)) = ε σ T. As the B-policy, being battery-aware, is more complex to implement than the E-policy, it may be desirable to set a minimum improvement level σ min to invoke the B-policy. It follows then that for rest periods with a recovery ratio smaller than ε = σ min / σ T, σ σ min, so that the B-policy should be used, otherwise, the E-policy should be used. C. A task scaling example Consider a set of two tasks T and T 2 that are such that: they are both released at time t =, Fig. 6. i(t) h l (t) h u (t) l(t) = i(t) h l (t) + u(t) = i(t) h u (t) σ(t) The battery model expressed as an LTI system task T 2 must be scheduled after task T, the tasks are not preemptible, they must both be completed by time T = 6 min. Suppose now that one of the parameters of the system (e.g. the voltage/frequency of a processor) can be scaled. The load current and duration of the tasks without scaling are (6 ma, 2 min) and (4 ma, 2 min), respectively. The load profiles after scaling are shown in Figure 5(a). Theorem B. in [7, Pg.32] states that when a certain amount of slack could be assigned to either of two tasks by down-scaling, it is better (in terms of σ) to down-scale the later task. Also, the actual charge lost l(t ) when T 2 is scaled is 7, ma min, but 5, ma min when T is scaled. Hence, we denote the policy that scales T 2 as B, and the other as E. Using (2) again with a β =.273 min /2 battery, we can obtain the profiles of the actual and apparent charge lost for both these schedules. These are plotted in Figure 5(b). It can be seen that σ T and l T are both positive. The value of ε was computed from (5) as.2. For both the σ B and the σ E curves, this was found to correspond to a recovery time of t r (ε ) = 5.87 min. As can be seen from Figure 5(b), this is also the point at which the optimality of the B policy is reversed. Further, the upper bound on the recovery time t r (ε ) computed from (5) is equal to 5.88 min, which is very close to the actual recovery time. Thus, a rest period of greater than 5.87 min caused E to be a better policy than B, both, in terms of actual charge lost and apparent charge lost. V. TASK GRANULARITY AND BATTERY OPTIMIZATION It has been pointed out before [], [7], [] that batteries are not sensitive to fine-grained task scheduling. Using a novel frequency domain model of a battery, we now formally analyze the relationship between granularity of task scheduling and improvements in σ. A. Frequency domain battery model We observed that the battery model described by (2) can be equivalently represented by the Linear and Time Invariant (LTI) system shown in Figure 6, where h l (t) is the unit step function, and h u (t) is given by X h u (t) = 2 e β2 m 2t, t. (6) Now, the h l (t) component simply computes the actual charge lost l(t) and does not involve any battery parameters. However, h u (t) depends on the battery parameter β. Hence, to characterize the battery s frequency response, it is sufficient to find H u ( f ), the Fourier transform of h u (t). This is given by X H u ( f ) = 2 β 2 m 2 + j2π f. (7) The DC response can be shown to reduce to H u () = π 2 /3β 2. Figure 7 shows a plot of H u ( f ) / H u () for different values of β. The magnitude frequency response was found to be a monotonic function of the β value, and the figure shows the frequency response

6 Fig. 7. H u (f) / H u () (db)!!2!3!4!5!6!7!8-3 db β =. min /2 β =.2 min /2 β = min /2 β = min /2 Practical range of β!9!4!2 2 4 Frequency f (Hz) Battery frequency response for different values of the β parameter τ = /f 3dB (s) β (min /2 ) Fig. 8. The battery response time vs the β parameter. curves for two extremes of the practical range of β values. Task scheduling at granularities less than second result in significant frequency components larger than Hz in I( f ), the frequency spectrum of the load current profile. From the figure, the magnitude response at Hz for real batteries ranges from - db to -3 db. At higher frequencies, the response degrades even further. This suggests that real batteries are not sensitive to fine-grained task scheduling. Also, the closer to ideal a battery is (higher β), the more sensitive it is to fine-grained scheduling. An extreme case of this is illustrated by the nearly flat frequency response of a hypothetical battery with β = min /2. However, at β values greater than, the battery discharge behavior is already so close to that of an ideal battery, that any battery-specific optimization techniques become redundant. B. The response time of a battery To quantify the notion of task granularity, we define the response time of a battery as the reciprocal of its -3 db cutoff frequency. Figure 8 shows a plot of the response time versus β over the range of practical values of β. It can be seen that the response time for bad (highly non-ideal) batteries is of the order of several minutes, while that for the good (close to ideal) batteries is of the order of seconds. This clearly suggests that fine-grained scheduling, for example, at the level of individual CPU tasks (typically of the order of milliseconds) does not warrant battery-specific techniques. Instead, the focus should be on pure energy minimization. C. A task scheduling example Consider a set of four tasks T,T 2,T 3 and T 4 such that Task T T 2 T 3 T 4 Load magnitude (ma) Load duration (min) TABLE II AN EXAMPLE TASK SET WITH LOAD MAGNITUDE AND DURATION REQUIREMENT OF EACH TASK. Percent improvement in σ Fig !2 2 4 Task granularity (s) x Improvement in σ (ma min) Improvement in σ(t ) for different task granularities. each task has a fixed load magnitude and duration shown in Table II, all tasks are released at time t =, all tasks must be completed by t = T, where T is the sum of the duration of all tasks (i.e. no idle periods). there are no task dependencies. We are free only to choose the order of execution of the tasks. As the deadline is the sum of the task durations, the task order uniquely determines the task start times. For such a case, it follows from Theorem B.2 in [7, Pg.34] that the apparent charge lost σ(t ) is minimized if the tasks are ordered in a non-increasing order of load currents {T 2,T,T 4,T 3 }, and maximized for a non-decreasing order of load currents {T 3,T 4,T,T 2 }. Let us denote the apparent charge lost at the end of the task set for these two extreme cases as σ ni (T ) (for non-increasing sequence) and σ nd (T ) (for non-decreasing sequence). Thus, the maximum improvement in σ that can be achieved by task scheduling is simply σ(t ) = σ nd (T ) σ ni (T ). Rakhmatov et al. [7] demonstrated that this difference is significant for a battery commonly used in pocket PCs, and this served as the motivating example for their work on task scheduling. We wish to study the effect of task granularity on this improvement σ. We now define the task granularity (somewhat arbitrarily) as the smallest load duration in the task set (in this case min). Suppose now that each task s duration were to be scaled by a factor s. The above-mentioned theorem still holds, but as the solid line in Figure 9 shows, the percentage improvement is only significant for task granularities of the order of ms to s. The reduction in percentage improvement at low task granularities can be explained by the corresponding low frequency response of the battery at high frequencies, as shown in Figure 7. ) Decreasing improvement at large granularities: However, the frequency response does not explain the reduction in percentage improvement at high task granularities. The dotted line in Figure 9 shows the absolute improvement in apparent charge lost that is achieved by task scheduling. It can be seen that at high task granularities, this improvement levels off. This is because of the charge recovery effect. From Section III-D, we know that every segment of a load profile contributes a certain amount of charge to the

7 total unavailable charge, and this contribution gradually reduces over time. A rest period is not necessary for the charge recovery process, it is only sufficient for a net charge recovery to be noticeable. If a task is of a very long duration D, it can be divided into two parts of successive durations D t r and t r, where t r is the upper bound on the recovery time derived before. Clearly, the earlier load segment of duration D t r has almost completely recovered its charge by time D, the original load duration. This means that a load of duration larger than t r is practically equivalent (for charge recovery purposes) to a load of duration t r. As pure task scheduling (without scaling) derives its benefit exclusively from the charge recovery effect, this reduction of the load duration to t r causes the improvement due to charge recovery to level off. Consequently, the percentage improvement reduces with increasing granularity. VI. RECOMMENDED POLICY Based on the above analysis, we propose the following general guidelines for choosing between B, a candidate battery-aware policy, and E, a candidate energy-aware policy. Calibrate the battery using the procedure mentioned in [7] and obtain its parameters α and β. Assuming no rest periods, compute σ T = σ E σ B, the difference in apparent charge lost by E and B, and also compute l T = l B l E, the maximum improvement in the actual charge lost by E over B. If l T >, (note strict inequality) Compute ε using (5) and the corresponding bound on the recovery time t r (ε ) using (5). If rest periods of length larger than t r (ε ) occur with high probability, choose E. Stop. Else, if l T = (or, both policies consume the same energy) Choose a value for σ min, the minimum improvement in σ that makes it acceptable to implement the more complex B policy over E. Compute the ratio ε = σ min / σ T, and the corresponding bound on the recovery time using (5). If rest periods of length larger than t r (ε) occur with high probability, choose E. Find the task granularity of the schedule determined by B. If it is more than an order of magnitude larger than the response time of the battery from Figure 8, choose E, else choose B. Some of these steps have been kept general on purpose, as their implementation will depend on the particular problem at hand. For example, the choice of σ min for a portable movie player could be chosen to be that value that creates an improvement of battery lifetime of at least 3 minutes. The value of T could be chosen as the duration of a movie for a portable DVD player, or the expected duration of continuous use for a portable audio player. VII. CONCLUSION We proposed two alternative interpretations of a high-level battery model: (i) a charge component model that allowed us to obtain a bound on the recovery time of a battery, and (ii) a frequency domain model that allowed us to compute the response time of a battery. We note that rest periods (of the order of a few minutes to several hours) are experienced by almost all portable battery-powered devices. We showed that the improvement promised by a batteryaware policy in the absence of rest periods reduces exponentially with time if rest periods are inserted. For the case when the duration of an upcoming rest period is known, we developed a criterion to choose between an energy-aware policy and a battery-aware policy. Further, the frequency domain model, along with the charge recovery effect, helped us to explain why battery-aware task scheduling is not advisable at both low and high task granularities. We believe the guidelines outlined above serve as a good starting point to evaluate if it is worth the extra cost of implementing a battery-aware approach over an energy-aware approach. VIII. ACKNOWLEDGEMENT This work was carried out at the National Science Foundation s State/Industry/University Cooperative Research Centers (NSF- S/IUCRC) Center for Low Power Electronics (CLPE). CLPE is supported by the NSF (Grant EEC ), the State of Arizona, and an industrial consortium. This work was also supported by NSF through grant CCR Any opinions, findings and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the NSF. REFERENCES [] T. L. Martin, Balancing batteries, power, and performance:system issues in CPU speed-setting for mobile computing, Ph.D. dissertation, Carnegie Mellon Univ., 999. [2] D. Linden and T. Reddy, Handbook of Batteries, 3rd ed. McGraw Hill, 2. [3] R. Rao, S. Vrudhula, and D. Rakhmatov, Battery modeling for energyaware system design, IEEE Computer: Special Issue on Power-Aware Computing, vol. 36, no. 2, pp , December 23. [4] J. F. Manwell, A. Rogers, G. Hayman, C. T. Avelar, and J. G. McGowan, Hybrid 2 A Hybrid System Simulation Model: Theory Manual, University of Massachusetts, November 998. [5] L. Benini, G. Castelli, A. Macii, E. Macii, and R. Scarsi, Discrete-time battery models for system-level low-power design, IEEE Trans. VLSI Sys., vol. 9, no. 5, pp , October 2. [6] C. F. Chiasserini and R. R. Rao, Energy efficient battery management, IEEE J. Selected Areas in Comm., vol. 9, no. 7, pp , July 2. [7] D. Rakhmatov and S. Vrudhula, Energy management for batterypowered embedded systems, Trans. on Embedded Computing Sys., vol. 2, no. 3, pp , 23. [8] P. Rong and M. Pedram, An analytical model for predicting the remaining battery capacity of lithium-ion batteries, in DATE 3: Proc. conference on Design, Automation and Test in Europe. IEEE Computer Society, 23, pp. 48. [9] M. Doyle, T. F. Fuller, and J. Newman, Modeling of galvanostatic charge and discharge of the lithium/polymer/insertion cell, J. Electrochem. Soc., vol. 4, no. 6, pp , 994. [] J. Luo and N. K. Jha, Battery-aware static scheduling for distributed real-time embedded systems, in DAC : Proc. Design Automation Conference. ACM Press, 2, pp [] J. Khan and R. Vemuri, An iterative algorithm for battery-aware task scheduling on portable computing platforms, in Design, Automation and Test in Europe, 25. Proceedings, 25, pp [2] P. Chowdhury and C. Chakrabarti, Battery aware task scheduling for a system-on-a-chip using voltage/clock scaling, in Signal Processing Systems, 22. (SIPS 2). IEEE Workshop on, 22, pp [3] M. Pedram and Q. Wu, Battery-powered digital CMOS design, Very Large Scale Integration (VLSI) Systems, IEEE Transactions on, vol., no. 5, pp. 6 67, 22. [4] P. Rong and M. Pedram, Battery-aware power management based on markovian decision processes, in ICCAD 2: Proc. Intl Conf. Computer-Aided Design, 22, pp [5] L. Benini, G. Castelli, A. Macii, and R. Scarsi, Battery-driven dynamic power management, Design & Test of Computers, IEEE, vol. 8, no. 2, pp. 53 6, 2.

Battery Lifetime Prediction for Energy-Aware Computing

Battery Lifetime Prediction for Energy-Aware Computing Battery Lifetime Prediction for Energy-Aware Computing Daler Rakhmatov and Sarma Vrudhula Center for Low Power Electronics ECE Department, University of Arizona Tucson, Arizona 85721 daler,sarma@ece.arizona.edu

More information

Energy Management for Battery-Powered Embedded Systems

Energy Management for Battery-Powered Embedded Systems Energy Management for Battery-Powered Embedded Systems DALER RAKHMATOV and SARMA VRUDHULA University of Arizona, Tucson Portable embedded computing systems require energy autonomy. This is achieved by

More information

A dynamic battery model for co-design in cyber-physical systems

A dynamic battery model for co-design in cyber-physical systems 2009 29th IEEE International Conference on Distributed Computing Systems Workshops A dynamic battery model for co-design in cyber-physical systems Fumin Zhang, Zhenwu Shi School of Electrical and Computer

More information

Optimal Control of Multi-battery Energy-aware Systems

Optimal Control of Multi-battery Energy-aware Systems 5th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC) Orlando, FL, USA, December -5, Optimal Control of Multi-battery Energy-aware Systems Tao Wang and Christos G. Cassandras

More information

Discharge Current Steering for Battery Lifetime Optimization

Discharge Current Steering for Battery Lifetime Optimization Discharge Current Steering for Battery Lifetime Optimization Luca Benini # Alberto Macii Enrico Macii Massimo Poncino # Università di Bologna Bologna, ITALY 40136 Politecnico di Torino Torino, ITALY 10129

More information

Scheduling of Frame-based Embedded Systems with Rechargeable Batteries

Scheduling of Frame-based Embedded Systems with Rechargeable Batteries Scheduling of Frame-based Embedded Systems with Rechargeable Batteries André Allavena Computer Science Department Cornell University Ithaca, NY 14853 andre@cs.cornell.edu Daniel Mossé Department of Computer

More information

Optimal and Adaptive Battery Discharge Strategies for Cyber-Physical Systems

Optimal and Adaptive Battery Discharge Strategies for Cyber-Physical Systems Optimal and Adaptive Battery Discharge Strategies for Cyber-Physical Systems Fumin Zhang and Zhenwu Shi Abstract We introduce a dynamic battery model that describes the variations of the capacity of a

More information

EDF Feasibility and Hardware Accelerators

EDF Feasibility and Hardware Accelerators EDF Feasibility and Hardware Accelerators Andrew Morton University of Waterloo, Waterloo, Canada, arrmorton@uwaterloo.ca Wayne M. Loucks University of Waterloo, Waterloo, Canada, wmloucks@pads.uwaterloo.ca

More information

CycleTandem: Energy-Saving Scheduling for Real-Time Systems with Hardware Accelerators

CycleTandem: Energy-Saving Scheduling for Real-Time Systems with Hardware Accelerators CycleTandem: Energy-Saving Scheduling for Real-Time Systems with Hardware Accelerators Sandeep D souza and Ragunathan (Raj) Rajkumar Carnegie Mellon University High (Energy) Cost of Accelerators Modern-day

More information

DC-DC Converter-Aware Power Management for Battery-Operated Embedded Systems

DC-DC Converter-Aware Power Management for Battery-Operated Embedded Systems 53.2 Converter-Aware Power Management for Battery-Operated Embedded Systems Yongseok Choi and Naehyuck Chang School of Computer Science & Engineering Seoul National University Seoul, Korea naehyuck@snu.ac.kr

More information

A 2-Approximation Algorithm for Scheduling Parallel and Time-Sensitive Applications to Maximize Total Accrued Utility Value

A 2-Approximation Algorithm for Scheduling Parallel and Time-Sensitive Applications to Maximize Total Accrued Utility Value A -Approximation Algorithm for Scheduling Parallel and Time-Sensitive Applications to Maximize Total Accrued Utility Value Shuhui Li, Miao Song, Peng-Jun Wan, Shangping Ren Department of Engineering Mechanics,

More information

Battery Level Estimation of Mobile Agents Under Communication Constraints

Battery Level Estimation of Mobile Agents Under Communication Constraints Battery Level Estimation of Mobile Agents Under Communication Constraints Jonghoek Kim, Fumin Zhang, and Magnus Egerstedt Electrical and Computer Engineering, Georgia Institute of Technology, USA jkim37@gatech.edu,fumin,

More information

Schedulability analysis of global Deadline-Monotonic scheduling

Schedulability analysis of global Deadline-Monotonic scheduling Schedulability analysis of global Deadline-Monotonic scheduling Sanjoy Baruah Abstract The multiprocessor Deadline-Monotonic (DM) scheduling of sporadic task systems is studied. A new sufficient schedulability

More information

Reliability-aware Thermal Management for Hard Real-time Applications on Multi-core Processors

Reliability-aware Thermal Management for Hard Real-time Applications on Multi-core Processors Reliability-aware Thermal Management for Hard Real-time Applications on Multi-core Processors Vinay Hanumaiah Electrical Engineering Department Arizona State University, Tempe, USA Email: vinayh@asu.edu

More information

Power-Aware Scheduling of Conditional Task Graphs in Real-Time Multiprocessor Systems

Power-Aware Scheduling of Conditional Task Graphs in Real-Time Multiprocessor Systems Power-Aware Scheduling of Conditional Task Graphs in Real-Time Multiprocessor Systems Dongkun Shin School of Computer Science and Engineering Seoul National University sdk@davinci.snu.ac.kr Jihong Kim

More information

Segment-Fixed Priority Scheduling for Self-Suspending Real-Time Tasks

Segment-Fixed Priority Scheduling for Self-Suspending Real-Time Tasks Segment-Fixed Priority Scheduling for Self-Suspending Real-Time Tasks Junsung Kim, Björn Andersson, Dionisio de Niz, and Raj Rajkumar Carnegie Mellon University 2/31 Motion Planning on Self-driving Parallel

More information

An Efficient Energy-Optimal Device-Scheduling Algorithm for Hard Real-Time Systems

An Efficient Energy-Optimal Device-Scheduling Algorithm for Hard Real-Time Systems An Efficient Energy-Optimal Device-Scheduling Algorithm for Hard Real-Time Systems S. Chakravarthula 2 S.S. Iyengar* Microsoft, srinivac@microsoft.com Louisiana State University, iyengar@bit.csc.lsu.edu

More information

Embedded Systems 14. Overview of embedded systems design

Embedded Systems 14. Overview of embedded systems design Embedded Systems 14-1 - Overview of embedded systems design - 2-1 Point of departure: Scheduling general IT systems In general IT systems, not much is known about the computational processes a priori The

More information

Polynomial Time Algorithms for Minimum Energy Scheduling

Polynomial Time Algorithms for Minimum Energy Scheduling Polynomial Time Algorithms for Minimum Energy Scheduling Philippe Baptiste 1, Marek Chrobak 2, and Christoph Dürr 1 1 CNRS, LIX UMR 7161, Ecole Polytechnique 91128 Palaiseau, France. Supported by CNRS/NSF

More information

Lecture 6. Real-Time Systems. Dynamic Priority Scheduling

Lecture 6. Real-Time Systems. Dynamic Priority Scheduling Real-Time Systems Lecture 6 Dynamic Priority Scheduling Online scheduling with dynamic priorities: Earliest Deadline First scheduling CPU utilization bound Optimality and comparison with RM: Schedulability

More information

Non-Work-Conserving Non-Preemptive Scheduling: Motivations, Challenges, and Potential Solutions

Non-Work-Conserving Non-Preemptive Scheduling: Motivations, Challenges, and Potential Solutions Non-Work-Conserving Non-Preemptive Scheduling: Motivations, Challenges, and Potential Solutions Mitra Nasri Chair of Real-time Systems, Technische Universität Kaiserslautern, Germany nasri@eit.uni-kl.de

More information

Workload-Ahead-Driven Online Energy Minimization Techniques for Battery-Powered Embedded Systems with Time-Constraints

Workload-Ahead-Driven Online Energy Minimization Techniques for Battery-Powered Embedded Systems with Time-Constraints Workload-Ahead-Driven Online Energy Minimization Techniques for Battery-Powered Embedded Systems with Time-Constraints YUAN CAI University of Iowa MARCUS T. SCHMITZ Robert Bosch GmbH BASHIR M. AL-HASHIMI

More information

Interconnect Lifetime Prediction for Temperature-Aware Design

Interconnect Lifetime Prediction for Temperature-Aware Design Interconnect Lifetime Prediction for Temperature-Aware Design UNIV. OF VIRGINIA DEPT. OF COMPUTER SCIENCE TECH. REPORT CS-23-2 NOVEMBER 23 Zhijian Lu, Mircea Stan, John Lach, Kevin Skadron Departments

More information

Rate-monotonic scheduling on uniform multiprocessors

Rate-monotonic scheduling on uniform multiprocessors Rate-monotonic scheduling on uniform multiprocessors Sanjoy K. Baruah The University of North Carolina at Chapel Hill Email: baruah@cs.unc.edu Joël Goossens Université Libre de Bruxelles Email: joel.goossens@ulb.ac.be

More information

Optimal Voltage Allocation Techniques for Dynamically Variable Voltage Processors

Optimal Voltage Allocation Techniques for Dynamically Variable Voltage Processors Optimal Allocation Techniques for Dynamically Variable Processors 9.2 Woo-Cheol Kwon CAE Center Samsung Electronics Co.,Ltd. San 24, Nongseo-Ri, Kiheung-Eup, Yongin-City, Kyounggi-Do, Korea Taewhan Kim

More information

Stochastic Dynamic Thermal Management: A Markovian Decision-based Approach. Hwisung Jung, Massoud Pedram

Stochastic Dynamic Thermal Management: A Markovian Decision-based Approach. Hwisung Jung, Massoud Pedram Stochastic Dynamic Thermal Management: A Markovian Decision-based Approach Hwisung Jung, Massoud Pedram Outline Introduction Background Thermal Management Framework Accuracy of Modeling Policy Representation

More information

Non-preemptive Fixed Priority Scheduling of Hard Real-Time Periodic Tasks

Non-preemptive Fixed Priority Scheduling of Hard Real-Time Periodic Tasks Non-preemptive Fixed Priority Scheduling of Hard Real-Time Periodic Tasks Moonju Park Ubiquitous Computing Lab., IBM Korea, Seoul, Korea mjupark@kr.ibm.com Abstract. This paper addresses the problem of

More information

Clock-driven scheduling

Clock-driven scheduling Clock-driven scheduling Also known as static or off-line scheduling Michal Sojka Czech Technical University in Prague, Faculty of Electrical Engineering, Department of Control Engineering November 8, 2017

More information

Online Work Maximization under a Peak Temperature Constraint

Online Work Maximization under a Peak Temperature Constraint Online Work Maximization under a Peak Temperature Constraint Thidapat Chantem Department of CSE University of Notre Dame Notre Dame, IN 46556 tchantem@nd.edu X. Sharon Hu Department of CSE University of

More information

Scheduling Periodic Real-Time Tasks on Uniprocessor Systems. LS 12, TU Dortmund

Scheduling Periodic Real-Time Tasks on Uniprocessor Systems. LS 12, TU Dortmund Scheduling Periodic Real-Time Tasks on Uniprocessor Systems Prof. Dr. Jian-Jia Chen LS 12, TU Dortmund 08, Dec., 2015 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 1 / 38 Periodic Control System Pseudo-code

More information

Lecture 13. Real-Time Scheduling. Daniel Kästner AbsInt GmbH 2013

Lecture 13. Real-Time Scheduling. Daniel Kästner AbsInt GmbH 2013 Lecture 3 Real-Time Scheduling Daniel Kästner AbsInt GmbH 203 Model-based Software Development 2 SCADE Suite Application Model in SCADE (data flow + SSM) System Model (tasks, interrupts, buses, ) SymTA/S

More information

CIS 4930/6930: Principles of Cyber-Physical Systems

CIS 4930/6930: Principles of Cyber-Physical Systems CIS 4930/6930: Principles of Cyber-Physical Systems Chapter 11 Scheduling Hao Zheng Department of Computer Science and Engineering University of South Florida H. Zheng (CSE USF) CIS 4930/6930: Principles

More information

On the Approximate Linear Programming Approach for Network Revenue Management Problems

On the Approximate Linear Programming Approach for Network Revenue Management Problems On the Approximate Linear Programming Approach for Network Revenue Management Problems Chaoxu Tong School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14853,

More information

Energy-Efficient Resource Allocation for Multi-User Mobile Edge Computing

Energy-Efficient Resource Allocation for Multi-User Mobile Edge Computing Energy-Efficient Resource Allocation for Multi-User Mobile Edge Computing Junfeng Guo, Zhaozhe Song, Ying Cui Department of Electronic Engineering, Shanghai Jiao Tong University, Shanghai, P. R. China

More information

Real-time Systems: Scheduling Periodic Tasks

Real-time Systems: Scheduling Periodic Tasks Real-time Systems: Scheduling Periodic Tasks Advanced Operating Systems Lecture 15 This work is licensed under the Creative Commons Attribution-NoDerivatives 4.0 International License. To view a copy of

More information

Energy Budgeting for Battery-Powered Sensors with a Known Task Schedule

Energy Budgeting for Battery-Powered Sensors with a Known Task Schedule Energy Budgeting for BatteryPowered Sensors with a Known Task Schedule Daler Rakhmatov ECE Department, University of Victoria Victoria, British Columbia, CANADA daler@uvic.ca ABSTRACT For example, assume

More information

Andrew Morton University of Waterloo Canada

Andrew Morton University of Waterloo Canada EDF Feasibility and Hardware Accelerators Andrew Morton University of Waterloo Canada Outline 1) Introduction and motivation 2) Review of EDF and feasibility analysis 3) Hardware accelerators and scheduling

More information

SPEED SCALING FOR ENERGY AWARE PROCESSOR SCHEDULING: ALGORITHMS AND ANALYSIS

SPEED SCALING FOR ENERGY AWARE PROCESSOR SCHEDULING: ALGORITHMS AND ANALYSIS SPEED SCALING FOR ENERGY AWARE PROCESSOR SCHEDULING: ALGORITHMS AND ANALYSIS by Daniel Cole B.S. in Computer Science and Engineering, The Ohio State University, 2003 Submitted to the Graduate Faculty of

More information

Che-Wei Chang Department of Computer Science and Information Engineering, Chang Gung University

Che-Wei Chang Department of Computer Science and Information Engineering, Chang Gung University Che-Wei Chang chewei@mail.cgu.edu.tw Department of Computer Science and Information Engineering, Chang Gung University } 2017/11/15 Midterm } 2017/11/22 Final Project Announcement 2 1. Introduction 2.

More information

PLA Minimization for Low Power VLSI Designs

PLA Minimization for Low Power VLSI Designs PLA Minimization for Low Power VLSI Designs Sasan Iman, Massoud Pedram Department of Electrical Engineering - Systems University of Southern California Chi-ying Tsui Department of Electrical and Electronics

More information

Optimal Utilization Bounds for the Fixed-priority Scheduling of Periodic Task Systems on Identical Multiprocessors. Sanjoy K.

Optimal Utilization Bounds for the Fixed-priority Scheduling of Periodic Task Systems on Identical Multiprocessors. Sanjoy K. Optimal Utilization Bounds for the Fixed-priority Scheduling of Periodic Task Systems on Identical Multiprocessors Sanjoy K. Baruah Abstract In fixed-priority scheduling the priority of a job, once assigned,

More information

Efficient Power Management Schemes for Dual-Processor Fault-Tolerant Systems

Efficient Power Management Schemes for Dual-Processor Fault-Tolerant Systems Efficient Power Management Schemes for Dual-Processor Fault-Tolerant Systems Yifeng Guo, Dakai Zhu The University of Texas at San Antonio Hakan Aydin George Mason University Outline Background and Motivation

More information

Real-time Scheduling of Periodic Tasks (1) Advanced Operating Systems Lecture 2

Real-time Scheduling of Periodic Tasks (1) Advanced Operating Systems Lecture 2 Real-time Scheduling of Periodic Tasks (1) Advanced Operating Systems Lecture 2 Lecture Outline Scheduling periodic tasks The rate monotonic algorithm Definition Non-optimality Time-demand analysis...!2

More information

Controlling Preemption for Better Schedulability in Multi-Core Systems

Controlling Preemption for Better Schedulability in Multi-Core Systems 2012 IEEE 33rd Real-Time Systems Symposium Controlling Preemption for Better Schedulability in Multi-Core Systems Jinkyu Lee and Kang G. Shin Dept. of Electrical Engineering and Computer Science, The University

More information

UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering. Fault Tolerant Computing ECE 655

UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering. Fault Tolerant Computing ECE 655 UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering Fault Tolerant Computing ECE 655 Part 1 Introduction C. M. Krishna Fall 2006 ECE655/Krishna Part.1.1 Prerequisites Basic courses in

More information

Energy-Efficient Real-Time Task Scheduling in Multiprocessor DVS Systems

Energy-Efficient Real-Time Task Scheduling in Multiprocessor DVS Systems Energy-Efficient Real-Time Task Scheduling in Multiprocessor DVS Systems Jian-Jia Chen *, Chuan Yue Yang, Tei-Wei Kuo, and Chi-Sheng Shih Embedded Systems and Wireless Networking Lab. Department of Computer

More information

HIGH-PERFORMANCE circuits consume a considerable

HIGH-PERFORMANCE circuits consume a considerable 1166 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL 17, NO 11, NOVEMBER 1998 A Matrix Synthesis Approach to Thermal Placement Chris C N Chu D F Wong Abstract In this

More information

Modeling charge polarization voltage for large lithium-ion batteries in electric vehicles

Modeling charge polarization voltage for large lithium-ion batteries in electric vehicles Journal of Industrial Engineeringand Management JIEM, 2013 6(2): 686-697 Online ISSN: 2013-0953 Print ISSN: 2013-8423 http://dx.doi.org/10.3926/jiem.895 Modeling charge polarization voltage for large lithium-ion

More information

Stochastic Optimization for Undergraduate Computer Science Students

Stochastic Optimization for Undergraduate Computer Science Students Stochastic Optimization for Undergraduate Computer Science Students Professor Joongheon Kim School of Computer Science and Engineering, Chung-Ang University, Seoul, Republic of Korea 1 Reference 2 Outline

More information

System Model. Real-Time systems. Giuseppe Lipari. Scuola Superiore Sant Anna Pisa -Italy

System Model. Real-Time systems. Giuseppe Lipari. Scuola Superiore Sant Anna Pisa -Italy Real-Time systems System Model Giuseppe Lipari Scuola Superiore Sant Anna Pisa -Italy Corso di Sistemi in tempo reale Laurea Specialistica in Ingegneria dell Informazione Università di Pisa p. 1/?? Task

More information

TEMPORAL WORKLOAD ANALYSIS AND ITS APPLICATION TO POWER-AWARE SCHEDULING

TEMPORAL WORKLOAD ANALYSIS AND ITS APPLICATION TO POWER-AWARE SCHEDULING TEMPORAL WORKLOAD ANALYSIS AND ITS APPLICATION TO POWER-AWARE SCHEDULING Ye-In Seol 1, Jeong-Uk Kim 1 and Young-Kuk Kim 2, 1 Green Energy Institute, Sangmyung University, Seoul, South Korea 2 Dept. of

More information

CMSC 451: Lecture 7 Greedy Algorithms for Scheduling Tuesday, Sep 19, 2017

CMSC 451: Lecture 7 Greedy Algorithms for Scheduling Tuesday, Sep 19, 2017 CMSC CMSC : Lecture Greedy Algorithms for Scheduling Tuesday, Sep 9, 0 Reading: Sects.. and. of KT. (Not covered in DPV.) Interval Scheduling: We continue our discussion of greedy algorithms with a number

More information

Embedded Systems Development

Embedded Systems Development Embedded Systems Development Lecture 3 Real-Time Scheduling Dr. Daniel Kästner AbsInt Angewandte Informatik GmbH kaestner@absint.com Model-based Software Development Generator Lustre programs Esterel programs

More information

Lecture 2: Metrics to Evaluate Systems

Lecture 2: Metrics to Evaluate Systems Lecture 2: Metrics to Evaluate Systems Topics: Metrics: power, reliability, cost, benchmark suites, performance equation, summarizing performance with AM, GM, HM Sign up for the class mailing list! Video

More information

CSE 380 Computer Operating Systems

CSE 380 Computer Operating Systems CSE 380 Computer Operating Systems Instructor: Insup Lee & Dianna Xu University of Pennsylvania, Fall 2003 Lecture Note 3: CPU Scheduling 1 CPU SCHEDULING q How can OS schedule the allocation of CPU cycles

More information

Dynamic I/O Power Management for Hard Real-time Systems 1

Dynamic I/O Power Management for Hard Real-time Systems 1 Dynamic I/O Power Management for Hard Real-time Systems 1 Vishnu Swaminathan y, Krishnendu Chakrabarty y and S. S. Iyengar z y Department of Electrical & Computer Engineering z Department of Computer Science

More information

Dictionary-Less Defect Diagnosis as Surrogate Single Stuck-At Faults

Dictionary-Less Defect Diagnosis as Surrogate Single Stuck-At Faults Dictionary-Less Defect Diagnosis as Surrogate Single Stuck-At Faults Chidambaram Alagappan and Vishwani D. Agrawal Department of Electrical and Computer Engineering Auburn University, Auburn, AL 36849,

More information

Parameter Derivation of Type-2 Discrete-Time Phase-Locked Loops Containing Feedback Delays

Parameter Derivation of Type-2 Discrete-Time Phase-Locked Loops Containing Feedback Delays Parameter Derivation of Type- Discrete-Time Phase-Locked Loops Containing Feedback Delays Joey Wilson, Andrew Nelson, and Behrouz Farhang-Boroujeny joey.wilson@utah.edu, nelson@math.utah.edu, farhang@ece.utah.edu

More information

Non-preemptive multiprocessor scheduling of strict periodic systems with precedence constraints

Non-preemptive multiprocessor scheduling of strict periodic systems with precedence constraints Non-preemptive multiprocessor scheduling of strict periodic systems with precedence constraints Liliana Cucu, Yves Sorel INRIA Rocquencourt, BP 105-78153 Le Chesnay Cedex, France liliana.cucu@inria.fr,

More information

Chapter 2. Planning Criteria. Turaj Amraee. Fall 2012 K.N.Toosi University of Technology

Chapter 2. Planning Criteria. Turaj Amraee. Fall 2012 K.N.Toosi University of Technology Chapter 2 Planning Criteria By Turaj Amraee Fall 2012 K.N.Toosi University of Technology Outline 1- Introduction 2- System Adequacy and Security 3- Planning Purposes 4- Planning Standards 5- Reliability

More information

Generalized Network Flow Techniques for Dynamic Voltage Scaling in Hard Real-Time Systems

Generalized Network Flow Techniques for Dynamic Voltage Scaling in Hard Real-Time Systems Generalized Network Flow Techniques for Dynamic Voltage Scaling in Hard Real-Time Systems Vishnu Swaminathan and Krishnendu Chakrabarty Department of Electrical & Computer Engineering Duke University Durham,

More information

On Non-Preemptive Scheduling of Periodic and Sporadic Tasks

On Non-Preemptive Scheduling of Periodic and Sporadic Tasks On Non-Preemptive Scheduling of Periodic and Sporadic Tasks Kevin Jeffay * Donald F. Stanat University of North Carolina at Chapel Hill Department of Computer Science Charles U. Martel ** University of

More information

Scheduling Algorithms for Multiprogramming in a Hard Realtime Environment

Scheduling Algorithms for Multiprogramming in a Hard Realtime Environment Scheduling Algorithms for Multiprogramming in a Hard Realtime Environment C. Liu and J. Layland Journal of the ACM, 20(1):46--61, January 1973. 2 Contents 1. Introduction and Background 2. The Environment

More information

SOME RESOURCE ALLOCATION PROBLEMS

SOME RESOURCE ALLOCATION PROBLEMS SOME RESOURCE ALLOCATION PROBLEMS A Dissertation Presented to the Faculty of the Graduate School of Cornell University in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy

More information

Multiprocessor Real-Time Scheduling Considering Concurrency and Urgency

Multiprocessor Real-Time Scheduling Considering Concurrency and Urgency Multiprocessor Real-Time Scheduling Considering Concurrency Urgency Jinkyu Lee, Arvind Easwaran, Insik Shin Insup Lee Dept. of Computer Science, KAIST, South Korea IPP-HURRAY! Research Group, Polytechnic

More information

Resilient and energy-aware algorithms

Resilient and energy-aware algorithms Resilient and energy-aware algorithms Anne Benoit ENS Lyon Anne.Benoit@ens-lyon.fr http://graal.ens-lyon.fr/~abenoit CR02-2016/2017 Anne.Benoit@ens-lyon.fr CR02 Resilient and energy-aware algorithms 1/

More information

Energy-efficient Mapping of Big Data Workflows under Deadline Constraints

Energy-efficient Mapping of Big Data Workflows under Deadline Constraints Energy-efficient Mapping of Big Data Workflows under Deadline Constraints Presenter: Tong Shu Authors: Tong Shu and Prof. Chase Q. Wu Big Data Center Department of Computer Science New Jersey Institute

More information

Capacitors. Chapter How capacitors work Inside a capacitor

Capacitors. Chapter How capacitors work Inside a capacitor Chapter 6 Capacitors In every device we have studied so far sources, resistors, diodes and transistors the relationship between voltage and current depends only on the present, independent of the past.

More information

AS computer hardware technology advances, both

AS computer hardware technology advances, both 1 Best-Harmonically-Fit Periodic Task Assignment Algorithm on Multiple Periodic Resources Chunhui Guo, Student Member, IEEE, Xiayu Hua, Student Member, IEEE, Hao Wu, Student Member, IEEE, Douglas Lautner,

More information

Relating Entropy Theory to Test Data Compression

Relating Entropy Theory to Test Data Compression Relating Entropy Theory to Test Data Compression Kedarnath J. Balakrishnan and Nur A. Touba Computer Engineering Research Center University of Texas, Austin, TX 7872 Email: {kjbala, touba}@ece.utexas.edu

More information

A Dynamic Real-time Scheduling Algorithm for Reduced Energy Consumption

A Dynamic Real-time Scheduling Algorithm for Reduced Energy Consumption A Dynamic Real-time Scheduling Algorithm for Reduced Energy Consumption Rohini Krishnapura, Steve Goddard, Ala Qadi Computer Science & Engineering University of Nebraska Lincoln Lincoln, NE 68588-0115

More information

Performance Optimal Processor Throttling Under Thermal Constraints

Performance Optimal Processor Throttling Under Thermal Constraints Performance Optimal Processor Throttling Under Thermal Constraints Ravishankar Rao and Sarma Vrudhula Consortium for Embedded Systems Arizona State University Tempe, AZ 85281, USA {ravirao, vrudhula}@asu.edu

More information

Scheduling periodic Tasks on Multiple Periodic Resources

Scheduling periodic Tasks on Multiple Periodic Resources Scheduling periodic Tasks on Multiple Periodic Resources Xiayu Hua, Zheng Li, Hao Wu, Shangping Ren* Department of Computer Science Illinois Institute of Technology Chicago, IL 60616, USA {xhua, zli80,

More information

Divisible Load Scheduling

Divisible Load Scheduling Divisible Load Scheduling Henri Casanova 1,2 1 Associate Professor Department of Information and Computer Science University of Hawai i at Manoa, U.S.A. 2 Visiting Associate Professor National Institute

More information

Oblivious Equilibrium: A Mean Field Approximation for Large-Scale Dynamic Games

Oblivious Equilibrium: A Mean Field Approximation for Large-Scale Dynamic Games Oblivious Equilibrium: A Mean Field Approximation for Large-Scale Dynamic Games Gabriel Y. Weintraub, Lanier Benkard, and Benjamin Van Roy Stanford University {gweintra,lanierb,bvr}@stanford.edu Abstract

More information

3. Scheduling issues. Common approaches 3. Common approaches 1. Preemption vs. non preemption. Common approaches 2. Further definitions

3. Scheduling issues. Common approaches 3. Common approaches 1. Preemption vs. non preemption. Common approaches 2. Further definitions Common approaches 3 3. Scheduling issues Priority-driven (event-driven) scheduling This class of algorithms is greedy They never leave available processing resources unutilized An available resource may

More information

Energy-aware checkpointing of divisible tasks with soft or hard deadlines

Energy-aware checkpointing of divisible tasks with soft or hard deadlines Energy-aware checkpointing of divisible tasks with soft or hard deadlines Guillaume Aupy 1, Anne Benoit 1,2, Rami Melhem 3, Paul Renaud-Goud 1 and Yves Robert 1,2,4 1. Ecole Normale Supérieure de Lyon,

More information

TOWARD THE PLACEMENT OF POWER MANAGEMENT POINTS IN REAL-TIME APPLICATIONS

TOWARD THE PLACEMENT OF POWER MANAGEMENT POINTS IN REAL-TIME APPLICATIONS Chapter 1 TOWARD THE PLACEMENT OF POWER MANAGEMENT POINTS IN REAL-TIME APPLICATIONS Nevine AbouGhazaleh, Daniel Mossé, Bruce Childers, Rami Melhem Department of Computer Science University of Pittsburgh

More information

Optimal Sensor Placement and Scheduling with Value of Information for Spatio-Temporal Infrastructure System Management

Optimal Sensor Placement and Scheduling with Value of Information for Spatio-Temporal Infrastructure System Management IASSAR Safety, Reliability, Risk, Resilience and Sustainability of Structures and Infrastructure 12th Int. Conf. on Structural Safety and Reliability, Vienna, Austria, 6 10 August 2017 Christian Bucher,

More information

Chapter 7 Direct-Current Circuits

Chapter 7 Direct-Current Circuits Chapter 7 Direct-Current Circuits 7. Introduction... 7. Electromotive Force... 7.3 Resistors in Series and in Parallel... 4 7.4 Kirchhoff s Circuit Rules... 6 7.5 Voltage-Current Measurements... 8 7.6

More information

Colored Bin Packing: Online Algorithms and Lower Bounds

Colored Bin Packing: Online Algorithms and Lower Bounds Noname manuscript No. (will be inserted by the editor) Colored Bin Packing: Online Algorithms and Lower Bounds Martin Böhm György Dósa Leah Epstein Jiří Sgall Pavel Veselý Received: date / Accepted: date

More information

Real-Time Systems. Event-Driven Scheduling

Real-Time Systems. Event-Driven Scheduling Real-Time Systems Event-Driven Scheduling Hermann Härtig WS 2018/19 Outline mostly following Jane Liu, Real-Time Systems Principles Scheduling EDF and LST as dynamic scheduling methods Fixed Priority schedulers

More information

Enhancing Multicore Reliability Through Wear Compensation in Online Assignment and Scheduling. Tam Chantem Electrical & Computer Engineering

Enhancing Multicore Reliability Through Wear Compensation in Online Assignment and Scheduling. Tam Chantem Electrical & Computer Engineering Enhancing Multicore Reliability Through Wear Compensation in Online Assignment and Scheduling Tam Chantem Electrical & Computer Engineering High performance Energy efficient Multicore Systems High complexity

More information

Balance the Battery life and real-time issues for portable Real-time embedded system by applying DVS with battery model

Balance the Battery life and real-time issues for portable Real-time embedded system by applying DVS with battery model Balance the Battery life and real-time issues for portable Real-time embedded system by applying DVS with battery model Chen Tianzhou, Huang Jiangwei, Xiang Lingxiang, Wu Xinliang tzchen@zjueducn,hjw@zjueducn,

More information

Process Scheduling for RTS. RTS Scheduling Approach. Cyclic Executive Approach

Process Scheduling for RTS. RTS Scheduling Approach. Cyclic Executive Approach Process Scheduling for RTS Dr. Hugh Melvin, Dept. of IT, NUI,G RTS Scheduling Approach RTS typically control multiple parameters concurrently Eg. Flight Control System Speed, altitude, inclination etc..

More information

Coordinated Aggregation of Distributed Resources

Coordinated Aggregation of Distributed Resources Coordinated Aggregation of Distributed Resources UC Berkeley October 13, 2011 Coordinated Aggregation 1 of 39 Co-conspirators Anand Subramanian, Manuel Garcia, Josh Taylor [Berkeley Students] Duncan Callaway,

More information

RUN-TIME EFFICIENT FEASIBILITY ANALYSIS OF UNI-PROCESSOR SYSTEMS WITH STATIC PRIORITIES

RUN-TIME EFFICIENT FEASIBILITY ANALYSIS OF UNI-PROCESSOR SYSTEMS WITH STATIC PRIORITIES RUN-TIME EFFICIENT FEASIBILITY ANALYSIS OF UNI-PROCESSOR SYSTEMS WITH STATIC PRIORITIES Department for Embedded Systems/Real-Time Systems, University of Ulm {name.surname}@informatik.uni-ulm.de Abstract:

More information

Analysis of Software Artifacts

Analysis of Software Artifacts Analysis of Software Artifacts System Performance I Shu-Ngai Yeung (with edits by Jeannette Wing) Department of Statistics Carnegie Mellon University Pittsburgh, PA 15213 2001 by Carnegie Mellon University

More information

Supplement of Improvement of Real-Time Multi-Core Schedulability with Forced Non- Preemption

Supplement of Improvement of Real-Time Multi-Core Schedulability with Forced Non- Preemption 12 Supplement of Improvement of Real-Time Multi-Core Schedulability with Forced Non- Preemption Jinkyu Lee, Department of Computer Science and Engineering, Sungkyunkwan University, South Korea. Kang G.

More information

The Concurrent Consideration of Uncertainty in WCETs and Processor Speeds in Mixed Criticality Systems

The Concurrent Consideration of Uncertainty in WCETs and Processor Speeds in Mixed Criticality Systems The Concurrent Consideration of Uncertainty in WCETs and Processor Speeds in Mixed Criticality Systems Zhishan Guo and Sanjoy Baruah Department of Computer Science University of North Carolina at Chapel

More information

Embedded Systems Design: Optimization Challenges. Paul Pop Embedded Systems Lab (ESLAB) Linköping University, Sweden

Embedded Systems Design: Optimization Challenges. Paul Pop Embedded Systems Lab (ESLAB) Linköping University, Sweden of /4 4 Embedded Systems Design: Optimization Challenges Paul Pop Embedded Systems Lab (ESLAB) Linköping University, Sweden Outline! Embedded systems " Example area: automotive electronics " Embedded systems

More information

Power-Saving Scheduling for Weakly Dynamic Voltage Scaling Devices

Power-Saving Scheduling for Weakly Dynamic Voltage Scaling Devices Power-Saving Scheduling for Weakly Dynamic Voltage Scaling Devices Jian-Jia Chen 1, Tei-Wei Kuo 2, and Hsueh-I Lu 2 1 Department of Computer Science and Information Engineering National Taiwan University,

More information

Load Regulating Algorithm for Static-Priority Task Scheduling on Multiprocessors

Load Regulating Algorithm for Static-Priority Task Scheduling on Multiprocessors Technical Report No. 2009-7 Load Regulating Algorithm for Static-Priority Task Scheduling on Multiprocessors RISAT MAHMUD PATHAN JAN JONSSON Department of Computer Science and Engineering CHALMERS UNIVERSITY

More information

Modeling Fixed Priority Non-Preemptive Scheduling with Real-Time Calculus

Modeling Fixed Priority Non-Preemptive Scheduling with Real-Time Calculus Modeling Fixed Priority Non-Preemptive Scheduling with Real-Time Calculus Devesh B. Chokshi and Purandar Bhaduri Department of Computer Science and Engineering Indian Institute of Technology Guwahati,

More information

Online Scheduling Switch for Maintaining Data Freshness in Flexible Real-Time Systems

Online Scheduling Switch for Maintaining Data Freshness in Flexible Real-Time Systems Online Scheduling Switch for Maintaining Data Freshness in Flexible Real-Time Systems Song Han 1 Deji Chen 2 Ming Xiong 3 Aloysius K. Mok 1 1 The University of Texas at Austin 2 Emerson Process Management

More information

certain class of distributions, any SFQ can be expressed as a set of thresholds on the sufficient statistic. For distributions

certain class of distributions, any SFQ can be expressed as a set of thresholds on the sufficient statistic. For distributions Score-Function Quantization for Distributed Estimation Parvathinathan Venkitasubramaniam and Lang Tong School of Electrical and Computer Engineering Cornell University Ithaca, NY 4853 Email: {pv45, lt35}@cornell.edu

More information

Symbolic Control of Incrementally Stable Systems

Symbolic Control of Incrementally Stable Systems Symbolic Control of Incrementally Stable Systems Antoine Girard Laboratoire Jean Kuntzmann, Université Joseph Fourier Grenoble, France Workshop on Formal Verification of Embedded Control Systems LCCC,

More information

PREDICTIVE STORAGE CONTROL FOR A CLASS OF POWER CONVERSION SYSTEMS

PREDICTIVE STORAGE CONTROL FOR A CLASS OF POWER CONVERSION SYSTEMS PREDICTIVE STORAGE CONTROL FOR A CLASS OF POWER CONVERSION SYSTEMS Bram de Jager Department of Mechanical Engineering, WH 32 Technische Universiteit Eindhoven, P.O. Box 53, 56 MB Eindhoven, The Netherlands

More information

Real-Time Scheduling and Resource Management

Real-Time Scheduling and Resource Management ARTIST2 Summer School 2008 in Europe Autrans (near Grenoble), France September 8-12, 2008 Real-Time Scheduling and Resource Management Lecturer: Giorgio Buttazzo Full Professor Scuola Superiore Sant Anna

More information

Optimal Energy Trade-off Schedules

Optimal Energy Trade-off Schedules Optimal Energy Trade-off Schedules Neal Barcelo, Daniel Cole, Dimitrios Letsios, Michael Nugent, and Kirk Pruhs Department of Computer Science University of Pittsburgh, Pittsburgh, Pennsylvania 15260 Email:

More information