Speed Scaling with an Arbitrary Convex Power Function
|
|
- Barrie Lambert
- 5 years ago
- Views:
Transcription
1 Spee Scaling with an Arbitrary Convex Power Function Nikhil Bansal Ho-Leung Chan Kirk Pruhs What matters most to the computer esigners at Google is not spee, but power, low power, because ata centers can consume as much electricity as a city. Dr. Eric Schmit, CEO of Google [ML2]. Abstract All of the theoretical spee scaling research to ate has assume that the power function, which expresses the power consumption P as a function of the processor spee s, is of the form P = s α, where α > 1 is some constant. Motivate in part by technological avances, we initiate a stuy of spee scaling with arbitrary convex power functions. We consier the problem of minimizing the total flow plus energy. Our main result is a (3+ɛ)-competitive algorithm for this problem, that hols for essentially any convex power function. We also give a (2 + ɛ)-competitive algorithm for the objective of fractional weighte flow plus energy. Even for power functions of the form s α, it was not previously known how to obtain competitiveness inepenent of α for these problems. We also introuce a moel of allowable spees that generalizes all known moels in the literature. IBM T.J. Watson Research, P.O. Box 218, Yorktown Heights, NY. nikhil@us.ibm.com Computer Science Department, University of Pittsburgh. hlchan@cs.pitt.eu Computer Science Department, University of Pittsburgh. kirk@cs.pitt.eu. Supporte in part by NSF grants CNS , CCF an IIS
2 1 Introuction Energy consumption has become a key issue in the esign of microprocessors. Major chip manufacturers, such as Intel, AMD an IBM, now prouce chips with ynamically scalable spees, an prouce associate software that enables an operating system to manage power by scaling processor spee. Within the last few years there has been a significant amount of research on the scheuling problems that arise in this setting. Generally these problems have ual objectives as one both wants to optimize some scheule quality of service objective (for example, total flow) an some power relate objective (for example, the total energy use). Scheuling algorithms for these problems have two components: A job selection policy that etermines which job to run an a spee scaling policy to etermine the spee at which the processor is run. All of the theoretical spee scaling research to ate has assume that the power function, which expresses the power consumption P as a function of the processor spee s, is of the form P = s α, where α > 1 is some constant. Let us call this the traitional moel. The traitional moel was motive by the fact that in CMOS base processors, the well known cube-root rule states that the spee is approximately the cube root of the power. So historically P = s 3 was a reasonable assumption. In the literature one fins ifferent variations on this traitional moel base on which spees are allowable. Most of the literature assumes the unboune spee moel, in which a processor can be run at any real spee in the range [, ). Some of the literature assumes the boune spee moel in which the allowable spees lie in some real interval [, T ]. Some of the literature on offline algorithms, assumes the iscrete spees moel in which there are a finite number of allowable spees. Our main contribution in this paper is to initiate theoretical investigations into spee scaling problems with more general power functions, an evelop algorithmic analysis techniques for this setting. For an explanation of the historical technological motivation for the traitional moel, an the current technological motivations for consiering more general power functions, see section 1.3. A seconary contribution is to introuce a moel for allowable spees that generalizes all of various moels foun in the literature. We will consier the objective of minimizing a linear combination of total (possibly weighte) flow an total energy use. Our thir contribution is to improve on the known results for this important funamental problem. Optimizing a linear combination of energy an total flow has the following natural interpretation. Suppose that the user specifies how much improvement in flow, call this amount ρ, is necessary to justify spening one unit of energy. For example, the user might specify that he is willing to spen 1 erg of energy from the battery for a ecrease of 4 micro-secons in flow. Then the optimal scheule, from this user s perspective, is the scheule that optimizes ρ = 4 times the energy use plus the total flow. By changing the units of either energy or time, one may assume without loss of generality that ρ = 1. Weighte flow generalizes both total flow, an total/average stretch, which is another common QoS measure. The stretch/slowown of a job is the flow ivie by the work of the job. When the user is aware of the size of a job (say if the user knows that he/she is ownloaing a vieo file instea of a text file) then perhaps slowown is a more appropriate measure of the happiness of a user than flow. Many server systems, such as operating systems an atabases, have mechanisms that allow the user or the system to give ifferent priorities to ifferent jobs. For example, Unix has the nice comman. In a spee scaling setting, the weight of a job is inicative of the flow versus energy trae-off for this job. The user may be willing to spen more energy to reuce the flow of a higher priority job, than for a lower priority job. 1.1 The Literature on Flow + Energy in the Traitional Moel Let us start with results in the unboune spee moel. [PUW4] gave an efficient offline algorithm to fin the scheule that minimizes average flow subject to a constraint on the amount of energy use, in 1
3 the case that jobs have unit work. This algorithm can also be use to fin optimal scheules when the objective is a linear combination of total flow an energy use. [PUW4] observe that in any locallyoptimal scheule, essentially each job i is run at a power proportional to the number of jobs that woul be elaye if job i was elaye. [AF6] propose the natural online spee scaling algorithm that always runs at a power equal to the number of unfinishe jobs (which is lower boun to the number of jobs that woul be elaye if the selecte job was elaye). [AF6] i not actually analyze this natural algorithm, but rather analyze a batche variation, in which jobs that are release while the current batch is running are ignore until the current batch finishes. [AF6] showe that for unit work jobs that this batche algorithm is O (( ) α ) -competitive by reasoning irectly about the optimal scheule. This gave a competitive ratio of about 4 when the cube-root rule hols. [AF6] also gave an efficient offline ynamic programming algorithm. [BPS7] consiere the algorithm that runs at a power equal to the unfinishe work (which is in general a bit less than the number of unfinishe jobs for unit work jobs). [BPS7] showe that for unit work jobs, this algorithm is 2-competitive with respect to the objective of fractional flow plus energy using an amortize local competitiveness argument. A job that is say 2/3 complete at time t, only contributes 1/3 to the increase in fractional flow at time t. [BPS7] then showe that the natural algorithm propose in [AF6] is 4-competitive for total flow plus energy for unit work jobs. [BPS7] then consiere the more general setting where jobs have arbitrary sizes an arbitrary weights an the objective is weighte flow plus energy. They consiere the algorithm that uses Highest Density First (HDF) for job selection, an always runs at a power equal to the fractional weight of the unfinishe jobs. [BPS7] showe that this algorithm is O( α log α )-competitive for fractional weighte flow plus energy using an amortize local competitiveness argument. [BPS7] then showe how to moify this algorithm to obtain an algorithm that is O( α2 )-competitive for (integral) weighte flow plus energy using the known log 2 α resource augmentation analysis of HDF [BLMSP1]. The competitive ratio was a bit less than 8 when the cube-root rule hols. Recently, [LLTWar] improves on the obtainable competitive ratio for total flow plus energy for arbitrary work an unit weight jobs. [LLTWar] consiers the job selection algorithm Shortest Remaining Processing Time (SRPT) an the spee scaling algorithm of running at a power proportional to the number of unfinishe jobs. [LLTWar] prove that this algorithm is O( α log α )-competitive for arbitrary size an unit weight jobs. When the cube-root rule hols, this competitive ratio was about Spee scaling papers prior to [LLTWar] use potential functions relate to the fractional amount of unfinishe work or weight. The main reason for consiering the fractional flow in previous works was that a potential function base on remaining fractional work varies continuously with time. A continuously varying potential function substantially simplifies the proofs as one only nees to consier instantaneous states of the online an offline algorithms. The main technical contribution of [LLTWar] was the introuction of a ifferent form of continuously varying potential functions that epen on the integral number of unfinishe jobs. [BCLLar] extene the results of [BPS7] for the unboune spee moel to the boune spee moel. The spee scaling algorithm was to run at the minimum of the spee recommene by the spee scaling algorithm in the unboune spee moel an the maximum spee of the processor. The contribution there was to evelop the algorithmic analysis techniques necessary to analyze this algorithm. The results for the boune spee moel in [BCLLar] were improve in [LLTWar], again by reasoning irectly about integral flow. Again [LLTWar] was able to prove competitive ratios of the form O( α hols, the obtaine competitive ratio was 4. log α ). When the cube-root rule 2
4 1.2 Our Results We assume that the allowable spees are a countable collection of isjoint subintervals of [, ). We assume that all the intervals, except possibly the rightmost interval, are close on both ens. The rightmost interval may be open on the right if the power P approaches infinity as the spee s approaches the rightmost enpoint of that interval. We assume that P is continuous an ifferentiable on all but countably many points. We also assume that P is convex, that is, when a < b an P (a) an P (b) are efine, then for all p (, 1) where P (pa + (1 p)b) is efine, it is the case that pp (a) + (1 p)p (b) P (pa + (1 p)b). Let us call this the convex moel. The intuitive physical interpretation of convexity means that the processing that one obtains from the expansion of a fixe amount of energy ecreases as spee increases. This convexity assumption hols in all situations that we are aware of. We give two main results in the convex moel. Theorem 1. Consier the scheuling algorithm that uses Shortest Remaining Processing Time (SRPT) for job selection an power equal to one more than the number of unfinishe jobs for spee scaling. In the convex moel, this scheuling algorithm is (3 + ɛ)-competitive for the objective of total flow plus energy on arbitrary-work unit-weight jobs. Theorem 2. Consier the scheuling algorithm that uses Highest Density First (HDF) for job selection an power equal to the fractional weight of the unfinishe jobs for spee scaling. In the convex moel, this scheuling algorithm is (2 + ɛ)-competitive for the objective of fractional weighte flow plus energy on arbitrary-work arbitrary-weight jobs. We establish these results through an amortize local competitiveness argument. As in [BCLLar], our potential function is base on the integral number of unfinishe jobs. However, our potential function is quite ifferent an more general than the potential function consiere in [BCLLar]. While Theorem 1 eals with integral flow, Theorem 2 only hols for fractional weighte flow. Obtaining a competitive ratio inepenent of α for the objective of (integral) weighte flow plus energy is rule out since resource augmentation is require to achieve O(1)-competitiveness for the objective of weighte flow on a fixe spee processor [BC]. Let us consier what these theorems say in the traitional moel. Theorem 1 slightly improves the best known competitive ratios, when the cube root rule hols, in both the unboune an boune spee moels. The potential functions use in all previous papers are specifically tailore towar the function P = s α. Moreover, these potential functions can not be use to show competitive ratios of o( α ln α ) for arbitrary work jobs. So while the competitive ratios were O(1)-competitive for a fixe α, they were not O(1)-competitive for a general power function of the form s α. Our new potential function not only allows us to break the α ln α barrier of, an it allows us to obtain O(1)-competitiveness for arbitrary convex power functions. This is a goo example of the inventor s paraox, that somehow attacking a more general problem allows clearer insights into a more specific problem. 1.3 Technological Motivations The power use by a processor can be partitione into ynamic power, the power use by switching when oing computations, an static/leakage power, which is the power lost in absence of any switching. Historically (say up until 5 years ago) the static power use by a processor was negligible compare to the ynamic power. Dynamic power is roughly proportional to sv 2, where V is the voltage. However as the minimum voltage require to rive the microprocessor at a esire spee is approximately proportional to the frequency [BBS + ], this leas to the well known cube-root rule that the spee s is roughly proportional to the cube-root of the power P, or equivalently, P = s 3, the power is proportional to the spee cube [BBS + ]. 3
5 However, currently the static power use by the common processors manufacture by Intel an AMD is now comparable to the ynamic power. The reason for this is that to increase processor spees, transistor sizes an esire transistor switching elays must ecrease. To obtain a smaller switching elay, the threshol voltage for the transistor must be ecrease. Unfortunately, subthreshol leakage current increases exponentially as threshol voltage ecreases [MJ6, BS]. This suggests moeling the spee to power function as something like P (s) = s α + c, where there is some range of spees [s min, s max ] that the processor can run at. Here α 3 comes from the cube-root rule for ynamic power, an c is a constant specifying the static power loss. There is however, goo motivation for consiering more general spee to power functions. We will state three more examples here. Example 1: In general, the higher spee that one can scale a core or a processor, the greater the static power (because the threshol voltage must be less). It has been propose that it might be avantageous to buil a processor consisting of ifferent circuitry for running jobs at ifferent spees spee ranges [BSC, BS]. Each circuitry woul have ifferent spee ranges, ifferent static powers ue to the ifferent threshol voltages, an ifferent power functions. Thus the spee scaling algorithm might be able to choose among a collection of power functions of the form P i (s) = a i s α + c i, where each P i (s) is applicable over a collection S i = {s i,1,..., s i,ki } of spees. (Note that in this context that we can not scale our units so that the multiplicative constant is always 1). In this setting, the power function of might be of the form: P (s) = min i:s S i a i s α + c i Example 2: Subthreshol leakage current/power is not inepenent of temperature. The temperature in turn epens on the spee that the processor is run. Some iscussion of how leakage current/power is relate to temperature can be foun in [BS], but it seems that this issue is perhaps not so well unerstoo. But in any case, there appears to be no reason to presume that the resulting power function woul be of the form s α. Example 3: Another motivation for consiering general spee to power functions is at the ata center level. The opening quote inicates the importance of power management at the ata center level. A nice investigation, by Google researchers, into the energy that a ata center coul save from spee scaling can be foun in [FWB7]. Ultimately what a ata center operator might care about is the cost of the energy use, not the actual amount of energy use. These can be quite ifferent because normally the contract that the ata center has with the electrical suppliers can have rastic increases in cost if various power threshols are exceee. So here the relevant function that one woul care about is the spee to cost (say measure in ollars per secon) function, not the spee to power function. There is no reason why these contracts nee to have a cost that rises as s α. 2 Preliminaries An instance consists of n jobs, where job i has a release time r i, an a positive work y i. In some cases each job may have a positive integer weight w i. An online scheuler is not aware of job i until time r i, an, at time r i, learns y i an weight w i. For each time, a scheuler specifies a job to be run an a spee at which the processor is run. We assume that preemption is allowe, that is, a job may be suspene an later restarte from the point of suspension. A job i completes once y i units of work have been performe on i. The spee is the rate at which work is complete; a job with work y run at a constant spee s completes in y s secons. The flow F i of a job i is its completion time minus its release time. The total flow is n i=1 F i. The weighte flow is n i=1 w i F i. 4
6 Let us quickly review amortize local competitiveness analysis. Consier an objective G. Let G A (t) be the increase in the objective in the scheule for algorithm A at time t. So when G is total flow plus energy, G A (t) is P (s t a) + n t a, where s t a is the spee for A at time t an n t a is the number of unfinishe jobs for A at time t. This is because energy is power integrate over time, an total flow is the number of unfinishe jobs integrate over time. Let OPT be the offline aversary that optimizes G an A be some algorithm. To prove A is c-competitive it suffices to give a potential function Φ(t) such that the following two conitions hol. Bounary conition: Φ is zero before any job is release an Φ is non-negative after all jobs are finishe. General conition: At any time t, G A (t) + Φ(t) t c G OP T (t) (1) To prove the general conition, it suffices to show that Φ oes not increase when a job arrives or is complete by A or OPT, an Equation 1 is true uring any perio of time without job arrival or completion. By integrating Equation 1, we can see that A is c-competitive for H. For more information see [Pru7]. 3 Flow Plus Energy Our goal in this section is to prove Theorem 1, that in the convex moel SRPT plus the natural spee scaling algorithm is (3 + ɛ)-competitive for the objective of total flow plus energy. We start by showing that this algorithm is 3-competitive if P also satisfies the following aitional special conitions: P is efine, an continuous an ifferentiable at all spees in [, ). P () =. P is strictly increasing. P is strictly convex. P is unboune. That is, for all c, the exists a spee s such that P (s) > c. Then in section 3.1 we show how to exten the analysis to the case when these special conitions o not hol, at the cost of an arbitrarily small increase in the competitive ratio. Definition of online algorithm A: Algorithm A scheules the unfinishe job with the least remaining unfinishe work, an runs at spee s t a where { s t P a = 1 (n t a + 1) if n t a 1 if n t a = where n t a is the number of unfinishe jobs for A at time t. As P () =, an P is strictly increasing, continuous an unboune, P 1 (i) exists an is unique for all integers i 1. Thus, A is well efine. Definition of potential function Φ: Let OPT be the offline aversary that minimizes total flow plus energy. We can assume without loss of generality that OPT runs SRPT. At any time t, let n t o be the number of unfinishe jobs in OPT. Let n t a(q) an n t o(q) be the number of unfinishe jobs with remaining size at least q in A an OPT, respectively, at time t. Let n t (q) = max{, n t a(q) n t o(q)}. We efine the the potential function Φ(t) = 3 5 f(n t (q))q
7 where f is efine by f() = i 1, f(i) f(i 1) = P (P 1 (i)) an P (x) is the erivative of P (x). Note that P (P 1 (i)) simply means substituting x = P 1 (i) into P (x). Since P (x) is ifferentiable, P (x) is well-efine. Hence, f is well-efine for all integer i. As both P (x) an P 1 (i) are increasing, we have f(i) f(i 1) f(j) f(j 1) if i > j. We enote (i) = f(i) f(i 1) for simplicity. We now wish to establish a crucial technical lemma, Lemma 4, which relies on the well known Young s inequality. Theorem 3 (Young s Inequality [HLP52](Section 8.3)). Let g be a real-value, continuous, an strictly increasing function on [, c] with c >. If g(), an a, b such that a [, c], an b [g(), g(c)], then a where g 1 is the inverse function of g. b g(x)x + g 1 (x)x ab g() Lemma 4. Let P be a strictly increasing, strictly convex, continuous an ifferentiable function. i, s a, s o be any real. Then Let P (P 1 (i))( s a + s o ) ( s a + P 1 (i))p (P 1 (i)) + P (s o ) i Proof. Since P is strictly increasing an strictly convex, P () an P (x) is strictly increasing. Thus, by Young s Inequality with g(x) = P (x), a = s o an b = P (P 1 (i)), we have s o P (P 1 (i)) so g(x)x + P (P 1 (i)) P () = P (s o ) + [ xg 1 (x) ] g(p 1 (i)) g() = P (s o ) + g(p 1 (w))p 1 (i) g 1 (x)x = P (s o ) + g(p 1 (i))p 1 (i) i g(p 1 (i)) g() P 1 (i) x(g 1 (x)) g(y)y (integration by parts) (let y = g 1 (x)) The lemma follows by aing s a P (P 1 (i)) to both sies. We are now reay to procee with our amortize local competitiveness argument. For the bounary conition, we observe that before any job is release an after all jobs are finishe, n t (q) = for all q, so Φ =. For the general conition, we observe that when a job is release, n t (q) is not change for all q, so Φ is unchange. When a job is complete by A or OPT, n t (q) is change only at the single point of q =, which oes not affect the integration, so Φ is also unchange. It remains to show at any time t uring a time interval without job arrival or completion, n t a + P (s t a) + t Φ(t) 3(nt o + P (s t o)) (2) 6
8 The rest of this proof consiers any such time t an proves Equation 2. We omit t from the superscript an the parameter for convenience. First observe that if n a =, then n(q) = for all q, an tφ =. Thus equation 2 trivially hols. Henceforth, we assume n a 1. Let q a be the remaining size of the job with the shortest remaining size in A (q a exists as n a 1). Note that A is processing a job of size q a. Define q o similarly for OPT (q o = if n o = ). Consier an infinitesimal interval of time [t, t + t]. The processing of A causes n a (q) to ecrease by 1 for q [q a s a t, q a ]. Similarly, the processing of OPT causes n o (q) to ecrease by 1 for q [q o s o t, q o ]. Denote the change in Φ uring this time interval as Φ. We consier three cases epening on whether n o > n a, n o < n a, or n o = n a. Case n o > n a : We show that Φ, as follows. At time t, n o (q) is greater than n a (q) for q in [q o s o t, q o ]. Thus, at time t + t, n o (q) is still at least n a (q) for q in [q o s o t, q o ]. It means that n(q) remains zero in this interval an Φ is not increase ue to the processing of OPT. The processing of A only ecreases Φ or leaves Φ unchange. Hence, Φ. Thus implies that t Φ an n a + P (s a ) + t Φ n a + n a + 1 3n o, so (2) hols. Case n o < n a : We show that either Φ 3 (n a n o )( s a +s o )t or Φ 3 (n a n o +1)( s a +s o )t, as follows. Consier 3 subcases epening on whether q a is smaller than, equal to, or bigger than q o. 1. Assume q a < q o. As n a (q) ecreases by 1 for q in [q a s a t, q a ], by the efinition of Φ, the change in Φ ue to A is 3(f(n a (q a ) n o (q a ) 1) f(n a (q a ) n o (q a )))s a t = 3 (n a (q a ) n o (q a ))s a t. Since q a < q o, we have n o (q a ) = n o (q o ) = n o. So the change in Φ ue to A is 3 (n a n o )s a t. As n o (q) ecreases by 1 for q in [q o s o t, q o ], by the efinition of Φ, the change in Φ ue to OPT is at most 3(f(n a (q o ) n o (q o ) + 1) f(n a (q o ) n o (q o )))s o t = 3 (n a (q o ) n o (q o ) + 1)s o t. Since q a < q o, we have n a (q o ) n a (q a ) 1. Thus, n a (q o ) n o (q o )+1 n a (q a ) n o (q o ). As (i) (j) for i j, the change in Φ ue to OPT is at most 3 (n a (q a ) n o (q o ))s o t = 3 (n a n o )s o t. Aing up the change in Φ ue to A an OPT, we obtain that Φ 3 (n a n o )( s a + s o )t. 2. Assume q a = q o. If s a s o, n(q) = n a (q) n o (q) ecreases by 1 for q in [q a s a t, q a s o t]. Hence, the change in Φ is 3(f(n a (q a ) n o (q a ) 1) f(n a (q a ) n o (q a )))(s a s o )t = 3 (n a n o )( s a + s o )t. Else if s a < s o, n(q) = n a (q) n o (q) increases by 1 for q in [q a s o t, q a s a t]. Hence, the change in Φ is 3(f(n a (q a ) n o (q a ) + 1) f(n a (q a ) n o (q a )))(s o s a )t = 3 (n a n + 1)( s a + s o )t. 3. Assume q a > q o. As n a (q) ecreases by 1 for q in [q a s a t, q a ], the change in Φ ue to A is 3(f(n a (q a ) n o (q a ) 1) f(n a (q a ) n o (q a )))s a t = 3 (n a (q a ) n o (q a ))s a t. Since q a > q o, we have n o (q a ) n o (q o ) 1. Thus, n a (q a ) n o (q a ) n a (q a ) n o (q o )+1. As (i) (j) for i j, The change in Φ ue to A is at most 3 (n a (q a ) n o (q o )+1)s a t = 3 (n a n o +1)s a t. On the other han, n o (q) ecreases by 1 for q in [q o s o t, q o ], so the change in Φ ue to OPT is at most 3(f(n a (q o ) n o (q o ) + 1) f(n a (q o ) n o (q o )))s o t = 3 (n a (q o ) n o (q o ) + 1)s o t. Since q a > q o, n a (q o ) = n a (q a ) = n a, an the change in Φ ue to OPT is at most 3 (n a n o + 1)s o t. Summing the change in Φ ue to A an OPT, Φ 3 (n a n o + 1)( s a + s o )t. Combining the above 3 subcases, it implies that if n o < n a, then either t Φ 3 (n a n )( s a + s o ) or t Φ 3 (n a n + 1)( s a + s o ). 7
9 Note that (n a n o )( s a + s o ) = P (P 1 (n a n o ))( s a + s o ). Setting i = n a n o in Lemma 4, we have that P (P 1 (n a n o ))( s a + s o ) ( s a + P 1 (n a n o ))P (P 1 (n a n o )) + P (s o ) n a + n o P (s o ) n a + n o ( as s a = P 1 (n a + 1) P 1 (n a n o )) Similarly, (n a n o + 1)( s a + s o ) = P (P 1 (n a n o + 1))( s a + s o ). Setting i = n a n o + 1 in Lemma 4, we have that P (P 1 (n a n o + 1))( s a + s o ) ( s a + P 1 (n a n o + 1))P (P 1 (n a n o + 1)) + P (s o ) n a + n o 1 P (s o ) n a + n o ( as s a = P 1 (n a + 1) P 1 (n a n o + 1)) Thus, t Φ 3P (s o) 3n a + 3n o in both cases. It follows that n a + P (s a ) + t Φ n a + n a P (s o ) 3n a + 3n o 3(P (s o ) + n o ). So Equation 2 is true if n o < n a. Case n o = n a : We show that Φ or Φ 3 (n a n o + 1)( s a + s o )t, as follows. Again, we consier 3 subcases epening whether q a < q o, q a = q o, or q a > q o. 1. Assume q a < q o. Then n(q) remains zero for q [q a s a t, q a ] an q [q o s o t, q o ]. Thus, n(q) is not change for any q an t Φ =. 2. Assume q a = q o. If s a s o, n(q) remains zero for q [q a s a t, q a ] (which also contains [q o s o t, q o ]). Thus, n(q) is unchange for any q an t Φ = Else if s a < s o, n(q) increases by 1 for q [q a s o t, q a s a t]. The change in Φ is 3(f(n a (q a ) n o (q o ) + 1) f(n a (q a ) n o (q o )))( s a + s o )t = 3 (n a n o + 1)( s a + s o )t 3. If q a > q o, it is ientical to subcase 3 of the case n o < n a, so Φ 3 (n a n o + 1)( s a + s o )t. It implies that t Φ or t Φ 3 (n a n o + 1)( s a + s o )t. Similar argument as before shows that Equation 2 is true if n o = n a. This completes the analysis when P satisfies the special conitions that we impose at the start of this section. 3.1 Removing the special conitions on P Consier an arbitrary power function P in the convex moel. We explain how to moify P so that it meets the special conitions without significantly raising the competitive ratio. If P is not increasing, one can make P unefine on those spees where there is a greater spee that consumes no more power. If the slowest spee s on which P is efine is not, then can shift P (s) own by reefining P as P (s) = P (s) P (s ), an P (s) = for s [, s ]. Then it is easy to see that if A is c-competitive with respect to this new P then A is also be c-competitive with respect to the original P. If P is efine at a an b but not at any point in the interval (a, b), then interpolate P linearly between a an b. We now argue that the online algorithm A with the ol power function can simulate running a spee s (a, b) in the new power function. Algorithm A can 8
10 simulate any spee s (a, b) by alternately running at spees a an b. Specifically, assume s = pa+(1 p)b for some < p < 1, we can run at spee a for a p fraction of the time an run at spee b for a (1 p) fraction of the time. It gives an effective spee of s an the energy usage is pp (a) + (1 p)p (b). P stays convex by the convexity of the original P. One can fin a power function between P an P + max{ɛ, ɛp } that is efine on the same omain of spees, is continuous, ifferentiable, strictly increasing, an strictly convex. The competitive ratio of A for the ol power function will be within ɛ of the competitive ratio of A for the new power function. If P is boune, where T is the maximum spee, then the natural interpretation of the algorithm is to run at spee min(p 1 (n a + 1), T ). We can follow the line of reasoning from [LLTWar]. We first note that at all times it must be the case that n a +1 n o P (T ). Then the analysis essentially then goes through as in the unboune case. In particular, in the case that n o < n a, we arrive at the same inequality of Φ t 3( s a + P 1 (n a n o + 1))P (P 1 (n a n o + 1)) n a + n o 1. If s a = P 1 (n a + 1), then we have that s a P 1 (n a n o + 1) as before. Else if s a = T, we still have that s a P 1 (n a n o + 1). 4 Fractional Weighte Flow Plus Energy Our goal in this section is to prove Theorem 2, that in the convex moel, HDF plus the natural spee scaling algorithm is (2 + ɛ)-competitive for the objective of fractional weighte flow plus energy. We start by showing, using an amortize local competitiveness argument, that this algorithm is 2-competitive if P also satisfies the special conitions from the last section. Definition of Online Algorithm A: The algorithm always runs the job of highest ensity. The ensity of a job is its weight ivie by its work. The spee s t a at time t is s t a = P 1 (w t a) where wa t is the total fractional weight of all unfinishe jobs for A at time t. Definition of the potential function Γ. Let OPT be the offline aversary that minimizes fractional weighte flow plus energy. At any time t, let wo t be the total fractional weight of all unfinishe jobs in OPT. For a job j, its inverse ensity is efine to be the ratio of its original size ivie by its original weight. At any time t, let wa(m) t enote the total fractional weight of all unfinishe jobs with inverse ensity at least m in A at time t. Define wo(m) t similarly for that of OPT. Let w t (m) = max{, wa(m) t wo(m)}. t We efine Γ(t) = 2 where h is the function such that for any real w, h(w t (m))m w h(w) = P (P 1 (w)) Since both P (x) an P 1 are increasing, P (P 1 (w))) is an increasing of function in w. Furthermore, h(w) can be written as h(w) = w P (P 1 (y))y. We now start the amortize local competitiveness analysis. For the bounary conition, we observe that before any job is release an after all jobs are complete, w t (m) = for all m, so Γ =. For the general conition, when a job is release, w t (m) is unchange for all m, so Γ is unchange. When a job is processe by A or OPT, the fractional weight of the job ecreases continuously to zero, so Γ is continuous an oes not ecrease ue to the completion of a job. It remains to show that at any time t uring a time interval without job arrival or completion, w t a + P (s t a) + t Γ(t) 2(wt o + P (s t o)) (3) 9
11 The rest of this proof consiers any such time t an proves Equation 3. We omit t from the superscript an the parameter for convenience. Then, t Γ = 2 t h(w(m))m = 2 = 2 (w(m)) h(w(m))( t w(m))m P (P 1 (w(m))( t w(m))m (Chain rule) Let m a an m o enote the minimum inverse ensity of an unfinishe job in A an OPT, respectively. (Let m a (resp., m o ) be if A (resp., OPT) has no unfinishe job.) Note that 1/m a an 1/m o are the ensity of the highest ensity job in A an OPT, respectively. Since A is running HDF at spee s a, w a (m) is ecreasing at the rate of (s a /m a ) for all m [, m a ] an w a (m) remains unchange for m > m a. Similarly, w o (m) is ecreasing at the rate of (s o /m o ) for m [, m o ] an remains unchange for m > m o. We consier three cases epening on w o > w a, w o < w a or w o = w a. Case w o > w a : We show that t Γ in this case. Note that for any m [, m o], w o (m) = w o > w a w a (m). Thus, for any m [, m o ], w(m) = max{, w a (m) w o (m)} remains zero an oes not change. It means that t w(m) = for m m o. For any m > m o, w o (m) remains unchange, so t w(m) for m > m o. Therefore, t Γ = 2 P (P 1 (w(m))( tw(m))m. We have w a + P (s a ) + t Γ 2w a < 2(w o + P (s o )), so Equation 3 is true. Case w o < w a : The ecrease in w a (m) causes a ecrease in Γ an the ecrease in w o (m) causes an increase in Γ. We analyze these two effects separately an boun them appropriately. For any m [, m a ], w a (m) is ecreasing at a rate of (s a /m a ), which causes Γ to ecrease at the rate of 2 m a P (P 1 (w(m)))( sa m a )m. For m [, m a ], w(m) = w a (m) w o (m) w a w o, so P (P 1 (w(m))) P (P 1 (w a w o )). Thus, 2 ma P (P 1 (w(m)))( s a m a )m 2 ma P (P 1 (w a w o )))( s a m a )m = 2P (P 1 (w a w o )))s a For m [, m o ], w o (m) is ecreasing at a rate of (s o /m o ), which causes Γ to increase at a rate at most 2 m o P (P 1 (w(m)))( so m o )m. For m [, m o ], w(m) = max{, w a (m) w o (m)} w a w o, so P (P 1 (w(m))) P (P 1 (w a w o )). Thus, 2 mo P (P 1 (w(m)))( s o m o )m 2 mo P (P 1 (w a w o )))( s o m o )m = 2P (P 1 (w a w o )))s o Summing the above two terms, we have t Γ 2P (P 1 (w a w o )( s a + s o ). By Lemma 4, it is at most 2( s a +P 1 (w a w o ))P (P 1 (w a w o ))+2(P (s o ) (w a w o )). Since s a = P 1 (w a ) P 1 (w a w o ), t Γ 2(P (s o) w a + w o ). We have w a + P (s a ) + t Γ 2w a + 2(P (s o ) w a + w o ) 2(P (s o ) + w o ), hence proving Equation 3. Case w o = w a : For m [, m o ], w o (m) is ecreasing at a rate of (s o /m o ), which causes Γ to increase at a rate at most 2 m o P (P 1 (w(m)))( so m o )m. For m [, m o ], w(m) = max{, w a (m) w o (m)} w a w o =, so P (P 1 (w(m))) = P (P 1 ()) an m o P (P 1 (w(m)))( so m o )m = P (P 1 ()))s o. By Lemma 4 with i =, s a =, we obtain that t Γ 2P (P 1 ()))s o 2P (s o ). We have w a + P (s a ) + t Γ 2w a + 2P (s o ) = 2(w o + P (s o )), hence proving Equation 3. This completes the analysis when the special conitions hol. The proof can be extene to the case when the special conitions o not hol in the same way as was one in the proof of Theorem 1. 1
12 References [AF6] [BBS + ] [BC] [BCLLar] Susanne Albers an Hiroshi Fujiwara. Energy-efficient algorithms for flow time minimization. In Lecture Notes in Computer Science (STACS), volume 3884, pages , 26. Davi M. Brooks, Praip Bose, Stanley E. Schuster, Hans Jacobson, Prabhakar N. Kuva, Alper Buyuktosunoglu, John-Davi Wellman, Victor Zyuban, Manish Gupta, an Peter W. Cook. Power-aware microarchitecture: Design an moeling challenges for next-generation microprocessors. IEEE Micro, 2(6):26 44, 2. Nikhil Bansal an Ho-Leung Chan. Weighte flow time oes not amit o(1)-competitive algorithms. submitte to SODA 29. N. Bansal, H.L. Chan, T.W. Lam, an L.K. Lee. Scheuling for boune spee processors. In International Colloquium on Automata, Languages an Programming, ICALP, 28, to appear. [BLMSP1] Luca Becchetti, Stefano Leonari, Alberto Marchetti-Spaccamela, an Kirk R. Pruhs. Online weighte flow time an ealine scheuling. In Workshop on Approximation Algorithms for Combinatorial Optimization, pages 36 47, 21. [BPS7] Nikhil Bansal, Kirk Pruhs, an Cliff Stein. Spee scaling for weighte flow time. In SODA 7: Proceeings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, pages , 27. [BS] J. Aam Butts an Gurinar S. Sohi. A static power moel for architects. In MICRO 33: Proceeings of the 33r annual ACM/IEEE international symposium on Microarchitecture, pages , 2. [BSC] Fre Bower, Daniel Sorin, an Lanon Cox. The impact of ynamically heterogeneous multicore processors on threa scheuling. Unpublishe. [FWB7] Xiaobo Fan, Wolf-Dietrich Weber, an Luiz Anre Barroso. Power provisioning for a warehouse-size computer. In ISCA 7: Proceeings of the 34th annual international symposium on Computer architecture, pages 13 23, 27. [HLP52] G. H. Hary, J. E. Littlewoo, an G. Polya. Inequalities. Cambrige University Press, [LLTWar] [MJ6] T.W. Lam, L.K. Lee, Isaac To, an P. Wong. Spee scaling functions base for flow time scheuling base on active job count. In Proc. of European Symposium on Algorithms, ESA, 28, to appear. Ke Meng an Russ Joseph. Process variation aware cache leakage management. In ISLPED 6: Proceeings of the 26 international symposium on Low power electronics an esign, pages , 26. [ML2] John Markoff an Steve Lohr. Intel s huge bet turns iffy. New York Times, September [Pru7] Kirk Pruhs. Competitive online scheuling for server systems. SIGMETRICS Performance Evaluation Review, 34(4):52 58,
13 [PUW4] Kirk Pruhs, Patchrawat Uthaisombut, an Gerhar Woeginger. Getting the best response for your erg. In Scananavian Workshop on Algorithms an Theory,
Speed Scaling with an Arbitrary Power Function
Spee Scaling with an Arbitrary Power Function Nikhil Bansal Ho-Leung Chan Kirk Pruhs What matters most to the computer esigners at Google is not spee, but power, low power, because ata centers can consume
More informationShortest-Elapsed-Time-First on a Multiprocessor
Shortest-Elapse-Time-First on a Multiprocessor Neal Barcelo, Sungjin Im 2, Benjamin Moseley 2, an Kirk Pruhs Department of Computer Science, University of Pittsburgh ncb30,kirk@cs.pitt.eu 2 Computer Science
More informationSPEED SCALING FOR WEIGHTED FLOW TIME
SPEED SCALING FOR WEIGHTED FLOW TIME NIKHIL BANSAL, KIRK PRUHS, AND CLIFF STEIN Abstract Intel s SpeedStep and AMD s PowerNOW technologies allow the Windows XP operating system to dynamically change the
More informationSpeed Scaling for Weighted Flow Time
Speed Scaling for Weighted Flow Time Nikhil Bansal Kirk Pruhs Cliff Stein 1 Introduction In addition to the traditional goal of efficiently managing time and space, many computers now need to efficiently
More informationNONCLAIRVOYANT SPEED SCALING FOR FLOW AND ENERGY
Symposium on Theoretical Aspects of Computer Science year (city), pp. numbers www.stacs-conf.org NONCLAIRVOYANT SPEED SCALING FOR FLOW AND ENERGY HO-LEUNG CHAN AND JEFF EDMONDS 2 AND TAK-WAH LAM 3 AND
More informationSpeed Scaling Functions for Flow Time Scheduling based on Active Job Count
Speed Scaling Functions for Flow Time Scheduling based on Active Job Count Tak-Wah Lam 1, Lap-Kei Lee 1, Isaac K. K. To 2, and Prudence W. H. Wong 2 1 Department of Computer Science, University of Hong
More informationScalably Scheduling Power-Heterogeneous Processors
Scalably Scheduling Power-Heterogeneous Processors Anupam Gupta 1, Ravishankar Krishnaswamy 1, and Kirk Pruhs 2 1 Computer Science Dept., Carnegie Mellon University, Pittsburgh, PA 15213, USA. 2 Computer
More informationCalculus of Variations
16.323 Lecture 5 Calculus of Variations Calculus of Variations Most books cover this material well, but Kirk Chapter 4 oes a particularly nice job. x(t) x* x*+ αδx (1) x*- αδx (1) αδx (1) αδx (1) t f t
More informationPDE Notes, Lecture #11
PDE Notes, Lecture # from Professor Jalal Shatah s Lectures Febuary 9th, 2009 Sobolev Spaces Recall that for u L loc we can efine the weak erivative Du by Du, φ := udφ φ C0 If v L loc such that Du, φ =
More informationMath 342 Partial Differential Equations «Viktor Grigoryan
Math 342 Partial Differential Equations «Viktor Grigoryan 6 Wave equation: solution In this lecture we will solve the wave equation on the entire real line x R. This correspons to a string of infinite
More informationA Sketch of Menshikov s Theorem
A Sketch of Menshikov s Theorem Thomas Bao March 14, 2010 Abstract Let Λ be an infinite, locally finite oriente multi-graph with C Λ finite an strongly connecte, an let p
More informationComputing Exact Confidence Coefficients of Simultaneous Confidence Intervals for Multinomial Proportions and their Functions
Working Paper 2013:5 Department of Statistics Computing Exact Confience Coefficients of Simultaneous Confience Intervals for Multinomial Proportions an their Functions Shaobo Jin Working Paper 2013:5
More informationSchrödinger s equation.
Physics 342 Lecture 5 Schröinger s Equation Lecture 5 Physics 342 Quantum Mechanics I Wenesay, February 3r, 2010 Toay we iscuss Schröinger s equation an show that it supports the basic interpretation of
More informationTime-of-Arrival Estimation in Non-Line-Of-Sight Environments
2 Conference on Information Sciences an Systems, The Johns Hopkins University, March 2, 2 Time-of-Arrival Estimation in Non-Line-Of-Sight Environments Sinan Gezici, Hisashi Kobayashi an H. Vincent Poor
More informationLecture 6: Calculus. In Song Kim. September 7, 2011
Lecture 6: Calculus In Song Kim September 7, 20 Introuction to Differential Calculus In our previous lecture we came up with several ways to analyze functions. We saw previously that the slope of a linear
More informationMath 1271 Solutions for Fall 2005 Final Exam
Math 7 Solutions for Fall 5 Final Eam ) Since the equation + y = e y cannot be rearrange algebraically in orer to write y as an eplicit function of, we must instea ifferentiate this relation implicitly
More informationLinear First-Order Equations
5 Linear First-Orer Equations Linear first-orer ifferential equations make up another important class of ifferential equations that commonly arise in applications an are relatively easy to solve (in theory)
More informationGetting the Best Response for Your Erg
Getting the Best Response for Your Erg KIRK PRUHS AND PATCHRAWAT UTHAISOMBUT University of Pittsurgh AND GERHARD WOEGINGER Eindhoven University of Technology Abstract. We consider the speed scaling problem
More informationOnline Speed Scaling Based on Active Job Count to Minimize Flow plus Energy
Online Speed Scaling Based on Active Job Count to Minimize Flow plus Energy Tak-Wah Lam Lap-Kei Lee Isaac K. K. To Prudence W. H. Wong 1 Introduction This paper is concerned with online scheduling algorithms
More informationGetting the Best Response for Your Erg
Getting the Best Response for Your Erg Kirk Pruhs Patchrawat Uthaisombut Gerhard Woeginger Abstract We consider the speed scaling problem of minimizing the average response time of a collection of dynamically
More informationClosed and Open Loop Optimal Control of Buffer and Energy of a Wireless Device
Close an Open Loop Optimal Control of Buffer an Energy of a Wireless Device V. S. Borkar School of Technology an Computer Science TIFR, umbai, Inia. borkar@tifr.res.in A. A. Kherani B. J. Prabhu INRIA
More informationNonclairvoyantly Scheduling Power-Heterogeneous Processors
Nonclairvoyantly Scheduling Power-Heterogeneous Processors Anupam Gupta Ravishankar Krishnaswamy Computer Science Department Carnegie Mellon University Pittsburgh, USA Kirk Pruhs Computer Science Department
More informationLectures - Week 10 Introduction to Ordinary Differential Equations (ODES) First Order Linear ODEs
Lectures - Week 10 Introuction to Orinary Differential Equations (ODES) First Orer Linear ODEs When stuying ODEs we are consiering functions of one inepenent variable, e.g., f(x), where x is the inepenent
More informationAgmon Kolmogorov Inequalities on l 2 (Z d )
Journal of Mathematics Research; Vol. 6, No. ; 04 ISSN 96-9795 E-ISSN 96-9809 Publishe by Canaian Center of Science an Eucation Agmon Kolmogorov Inequalities on l (Z ) Arman Sahovic Mathematics Department,
More informationSpeed Scaling to Manage Temperature
Speed Scaling to Manage Temperature Leon Atkins 1, Guillaume Aupy 2, Daniel Cole 3, and Kirk Pruhs 4, 1 Department of Computer Science, University of Bristol, atkins@compsci.bristol.ac.uk 2 Computer Science
More informationSeparation of Variables
Physics 342 Lecture 1 Separation of Variables Lecture 1 Physics 342 Quantum Mechanics I Monay, January 25th, 2010 There are three basic mathematical tools we nee, an then we can begin working on the physical
More informationLower Bounds for the Smoothed Number of Pareto optimal Solutions
Lower Bouns for the Smoothe Number of Pareto optimal Solutions Tobias Brunsch an Heiko Röglin Department of Computer Science, University of Bonn, Germany brunsch@cs.uni-bonn.e, heiko@roeglin.org Abstract.
More informationSPEED 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 informationA new proof of the sharpness of the phase transition for Bernoulli percolation on Z d
A new proof of the sharpness of the phase transition for Bernoulli percolation on Z Hugo Duminil-Copin an Vincent Tassion October 8, 205 Abstract We provie a new proof of the sharpness of the phase transition
More informationJUST THE MATHS UNIT NUMBER DIFFERENTIATION 2 (Rates of change) A.J.Hobson
JUST THE MATHS UNIT NUMBER 10.2 DIFFERENTIATION 2 (Rates of change) by A.J.Hobson 10.2.1 Introuction 10.2.2 Average rates of change 10.2.3 Instantaneous rates of change 10.2.4 Derivatives 10.2.5 Exercises
More informationMore from Lesson 6 The Limit Definition of the Derivative and Rules for Finding Derivatives.
Math 1314 ONLINE More from Lesson 6 The Limit Definition of the Derivative an Rules for Fining Derivatives Eample 4: Use the Four-Step Process for fining the erivative of the function Then fin f (1) f(
More informationIntroduction to the Vlasov-Poisson system
Introuction to the Vlasov-Poisson system Simone Calogero 1 The Vlasov equation Consier a particle with mass m > 0. Let x(t) R 3 enote the position of the particle at time t R an v(t) = ẋ(t) = x(t)/t its
More informationSYNCHRONOUS SEQUENTIAL CIRCUITS
CHAPTER SYNCHRONOUS SEUENTIAL CIRCUITS Registers an counters, two very common synchronous sequential circuits, are introuce in this chapter. Register is a igital circuit for storing information. Contents
More informationCalculus of Variations
Calculus of Variations Lagrangian formalism is the main tool of theoretical classical mechanics. Calculus of Variations is a part of Mathematics which Lagrangian formalism is base on. In this section,
More information05 The Continuum Limit and the Wave Equation
Utah State University DigitalCommons@USU Founations of Wave Phenomena Physics, Department of 1-1-2004 05 The Continuum Limit an the Wave Equation Charles G. Torre Department of Physics, Utah State University,
More informationA simple model for the small-strain behaviour of soils
A simple moel for the small-strain behaviour of soils José Jorge Naer Department of Structural an Geotechnical ngineering, Polytechnic School, University of São Paulo 05508-900, São Paulo, Brazil, e-mail:
More informationA Course in Machine Learning
A Course in Machine Learning Hal Daumé III 12 EFFICIENT LEARNING So far, our focus has been on moels of learning an basic algorithms for those moels. We have not place much emphasis on how to learn quickly.
More informationLecture Introduction. 2 Examples of Measure Concentration. 3 The Johnson-Lindenstrauss Lemma. CS-621 Theory Gems November 28, 2012
CS-6 Theory Gems November 8, 0 Lecture Lecturer: Alesaner Mąry Scribes: Alhussein Fawzi, Dorina Thanou Introuction Toay, we will briefly iscuss an important technique in probability theory measure concentration
More informationTable of Common Derivatives By David Abraham
Prouct an Quotient Rules: Table of Common Derivatives By Davi Abraham [ f ( g( ] = [ f ( ] g( + f ( [ g( ] f ( = g( [ f ( ] g( g( f ( [ g( ] Trigonometric Functions: sin( = cos( cos( = sin( tan( = sec
More informationWeighted flow time does not admit O(1)-competitive algorithms
Weighted flow time does not admit O(-competitive algorithms Nihil Bansal Ho-Leung Chan Abstract We consider the classic online scheduling problem of minimizing the total weighted flow time on a single
More informationDiophantine Approximations: Examining the Farey Process and its Method on Producing Best Approximations
Diophantine Approximations: Examining the Farey Process an its Metho on Proucing Best Approximations Kelly Bowen Introuction When a person hears the phrase irrational number, one oes not think of anything
More informationθ x = f ( x,t) could be written as
9. Higher orer PDEs as systems of first-orer PDEs. Hyperbolic systems. For PDEs, as for ODEs, we may reuce the orer by efining new epenent variables. For example, in the case of the wave equation, (1)
More informationCompetitive Algorithms for Due Date Scheduling
Competitive Algorithms for Due Date Scheduling Nikhil Bansal Ho-Leung Chan Kirk Pruhs As a strategic weapon, time is the equivalent of money, productivity, quality, even innovation. Abstract George Stalk,
More informationMake graph of g by adding c to the y-values. on the graph of f by c. multiplying the y-values. even-degree polynomial. graph goes up on both sides
Reference 1: Transformations of Graphs an En Behavior of Polynomial Graphs Transformations of graphs aitive constant constant on the outsie g(x) = + c Make graph of g by aing c to the y-values on the graph
More informationOnline Appendix for Trade Policy under Monopolistic Competition with Firm Selection
Online Appenix for Trae Policy uner Monopolistic Competition with Firm Selection Kyle Bagwell Stanfor University an NBER Seung Hoon Lee Georgia Institute of Technology September 6, 2018 In this Online
More information12.11 Laplace s Equation in Cylindrical and
SEC. 2. Laplace s Equation in Cylinrical an Spherical Coorinates. Potential 593 2. Laplace s Equation in Cylinrical an Spherical Coorinates. Potential One of the most important PDEs in physics an engineering
More information'HVLJQ &RQVLGHUDWLRQ LQ 0DWHULDO 6HOHFWLRQ 'HVLJQ 6HQVLWLYLW\,1752'8&7,21
Large amping in a structural material may be either esirable or unesirable, epening on the engineering application at han. For example, amping is a esirable property to the esigner concerne with limiting
More informationScalably Scheduling Power-Heterogeneous Processors
Carnegie Mellon University Research Showcase @ CMU Computer Science Department School of Computer Science 5-2011 Scalably Scheduling Power-Heterogeneous Processors Anupam Gupta Carnegie Mellon University
More informationLecture 5. Symmetric Shearer s Lemma
Stanfor University Spring 208 Math 233: Non-constructive methos in combinatorics Instructor: Jan Vonrák Lecture ate: January 23, 208 Original scribe: Erik Bates Lecture 5 Symmetric Shearer s Lemma Here
More informationEquilibrium in Queues Under Unknown Service Times and Service Value
University of Pennsylvania ScholarlyCommons Finance Papers Wharton Faculty Research 1-2014 Equilibrium in Queues Uner Unknown Service Times an Service Value Laurens Debo Senthil K. Veeraraghavan University
More informationCounting Lattice Points in Polytopes: The Ehrhart Theory
3 Counting Lattice Points in Polytopes: The Ehrhart Theory Ubi materia, ibi geometria. Johannes Kepler (1571 1630) Given the profusion of examples that gave rise to the polynomial behavior of the integer-point
More informationQF101: Quantitative Finance September 5, Week 3: Derivatives. Facilitator: Christopher Ting AY 2017/2018. f ( x + ) f(x) f(x) = lim
QF101: Quantitative Finance September 5, 2017 Week 3: Derivatives Facilitator: Christopher Ting AY 2017/2018 I recoil with ismay an horror at this lamentable plague of functions which o not have erivatives.
More information19 Eigenvalues, Eigenvectors, Ordinary Differential Equations, and Control
19 Eigenvalues, Eigenvectors, Orinary Differential Equations, an Control This section introuces eigenvalues an eigenvectors of a matrix, an iscusses the role of the eigenvalues in etermining the behavior
More informationFinal Exam Study Guide and Practice Problems Solutions
Final Exam Stuy Guie an Practice Problems Solutions Note: These problems are just some of the types of problems that might appear on the exam. However, to fully prepare for the exam, in aition to making
More informationPerfect Matchings in Õ(n1.5 ) Time in Regular Bipartite Graphs
Perfect Matchings in Õ(n1.5 ) Time in Regular Bipartite Graphs Ashish Goel Michael Kapralov Sanjeev Khanna Abstract We consier the well-stuie problem of fining a perfect matching in -regular bipartite
More informationApplications of First Order Equations
Applications of First Orer Equations Viscous Friction Consier a small mass that has been roppe into a thin vertical tube of viscous flui lie oil. The mass falls, ue to the force of gravity, but falls more
More informationLower bounds on Locality Sensitive Hashing
Lower bouns on Locality Sensitive Hashing Rajeev Motwani Assaf Naor Rina Panigrahy Abstract Given a metric space (X, X ), c 1, r > 0, an p, q [0, 1], a istribution over mappings H : X N is calle a (r,
More informationQuantum Mechanics in Three Dimensions
Physics 342 Lecture 20 Quantum Mechanics in Three Dimensions Lecture 20 Physics 342 Quantum Mechanics I Monay, March 24th, 2008 We begin our spherical solutions with the simplest possible case zero potential.
More informationLecture 22. Lecturer: Michel X. Goemans Scribe: Alantha Newman (2004), Ankur Moitra (2009)
8.438 Avance Combinatorial Optimization Lecture Lecturer: Michel X. Goemans Scribe: Alantha Newman (004), Ankur Moitra (009) MultiFlows an Disjoint Paths Here we will survey a number of variants of isjoint
More informationIPA Derivatives for Make-to-Stock Production-Inventory Systems With Backorders Under the (R,r) Policy
IPA Derivatives for Make-to-Stock Prouction-Inventory Systems With Backorers Uner the (Rr) Policy Yihong Fan a Benamin Melame b Yao Zhao c Yorai Wari Abstract This paper aresses Infinitesimal Perturbation
More informationPhysics 5153 Classical Mechanics. The Virial Theorem and The Poisson Bracket-1
Physics 5153 Classical Mechanics The Virial Theorem an The Poisson Bracket 1 Introuction In this lecture we will consier two applications of the Hamiltonian. The first, the Virial Theorem, applies to systems
More informationBalancing Expected and Worst-Case Utility in Contracting Models with Asymmetric Information and Pooling
Balancing Expecte an Worst-Case Utility in Contracting Moels with Asymmetric Information an Pooling R.B.O. erkkamp & W. van en Heuvel & A.P.M. Wagelmans Econometric Institute Report EI2018-01 9th January
More information28.1 Parametric Yield Estimation Considering Leakage Variability
8.1 Parametric Yiel Estimation Consiering Leakage Variability Rajeev R. Rao, Aniruh Devgan*, Davi Blaauw, Dennis Sylvester University of Michigan, Ann Arbor, MI, *IBM Corporation, Austin, TX {rrrao, blaauw,
More informationMath Chapter 2 Essentials of Calculus by James Stewart Prepared by Jason Gaddis
Math 231 - Chapter 2 Essentials of Calculus by James Stewart Prepare by Jason Gais Chapter 2 - Derivatives 21 - Derivatives an Rates of Change Definition A tangent to a curve is a line that intersects
More informationThe total derivative. Chapter Lagrangian and Eulerian approaches
Chapter 5 The total erivative 51 Lagrangian an Eulerian approaches The representation of a flui through scalar or vector fiels means that each physical quantity uner consieration is escribe as a function
More informationNon-clairvoyant Scheduling for Minimizing Mean Slowdown
Non-clairvoyant Scheduling for Minimizing Mean Slowdown N. Bansal K. Dhamdhere J. Könemann A. Sinha April 2, 2003 Abstract We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant
More informationUNDERSTANDING INTEGRATION
UNDERSTANDING INTEGRATION Dear Reaer The concept of Integration, mathematically speaking, is the "Inverse" of the concept of result, the integration of, woul give us back the function f(). This, in a way,
More information1 dx. where is a large constant, i.e., 1, (7.6) and Px is of the order of unity. Indeed, if px is given by (7.5), the inequality (7.
Lectures Nine an Ten The WKB Approximation The WKB metho is a powerful tool to obtain solutions for many physical problems It is generally applicable to problems of wave propagation in which the frequency
More informationA transmission problem for the Timoshenko system
Volume 6, N., pp. 5 34, 7 Copyright 7 SBMAC ISSN -85 www.scielo.br/cam A transmission problem for the Timoshenko system C.A. RAPOSO, W.D. BASTOS an M.L. SANTOS 3 Department of Mathematics, UFSJ, Praça
More informationSensors & Transducers 2015 by IFSA Publishing, S. L.
Sensors & Transucers, Vol. 184, Issue 1, January 15, pp. 53-59 Sensors & Transucers 15 by IFSA Publishing, S. L. http://www.sensorsportal.com Non-invasive an Locally Resolve Measurement of Soun Velocity
More informationFractional Geometric Calculus: Toward A Unified Mathematical Language for Physics and Engineering
Fractional Geometric Calculus: Towar A Unifie Mathematical Language for Physics an Engineering Xiong Wang Center of Chaos an Complex Network, Department of Electronic Engineering, City University of Hong
More informationII. First variation of functionals
II. First variation of functionals The erivative of a function being zero is a necessary conition for the etremum of that function in orinary calculus. Let us now tackle the question of the equivalent
More informationImproved Rate-Based Pull and Push Strategies in Large Distributed Networks
Improve Rate-Base Pull an Push Strategies in Large Distribute Networks Wouter Minnebo an Benny Van Hout Department of Mathematics an Computer Science University of Antwerp - imins Mielheimlaan, B-00 Antwerp,
More informationScheduling for Speed Bounded Processors
Scheduling for Speed Bounded Processors Nikhil Bansal, Ho-Leung Chan, Tak-Wah Lam, and Lap-Kei Lee Abstract. We consider online scheduling algorithms in the dynamic speed scaling model, where a processor
More informationarxiv: v1 [physics.flu-dyn] 8 May 2014
Energetics of a flui uner the Boussinesq approximation arxiv:1405.1921v1 [physics.flu-yn] 8 May 2014 Kiyoshi Maruyama Department of Earth an Ocean Sciences, National Defense Acaemy, Yokosuka, Kanagawa
More informationinflow outflow Part I. Regular tasks for MAE598/494 Task 1
MAE 494/598, Fall 2016 Project #1 (Regular tasks = 20 points) Har copy of report is ue at the start of class on the ue ate. The rules on collaboration will be release separately. Please always follow the
More informationSliding mode approach to congestion control in connection-oriented communication networks
JOURNAL OF APPLIED COMPUTER SCIENCE Vol. xx. No xx (200x), pp. xx-xx Sliing moe approach to congestion control in connection-oriente communication networks Anrzej Bartoszewicz, Justyna Żuk Technical University
More informationOn the enumeration of partitions with summands in arithmetic progression
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 8 (003), Pages 149 159 On the enumeration of partitions with summans in arithmetic progression M. A. Nyblom C. Evans Department of Mathematics an Statistics
More informationAn Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback
Journal of Machine Learning Research 8 07) - Submitte /6; Publishe 5/7 An Optimal Algorithm for Banit an Zero-Orer Convex Optimization with wo-point Feeback Oha Shamir Department of Computer Science an
More informationOn the Aloha throughput-fairness tradeoff
On the Aloha throughput-fairness traeoff 1 Nan Xie, Member, IEEE, an Steven Weber, Senior Member, IEEE Abstract arxiv:1605.01557v1 [cs.it] 5 May 2016 A well-known inner boun of the stability region of
More informationThe derivative of a function f(x) is another function, defined in terms of a limiting expression: f(x + δx) f(x)
Y. D. Chong (2016) MH2801: Complex Methos for the Sciences 1. Derivatives The erivative of a function f(x) is another function, efine in terms of a limiting expression: f (x) f (x) lim x δx 0 f(x + δx)
More information. Using a multinomial model gives us the following equation for P d. , with respect to same length term sequences.
S 63 Lecture 8 2/2/26 Lecturer Lillian Lee Scribes Peter Babinski, Davi Lin Basic Language Moeling Approach I. Special ase of LM-base Approach a. Recap of Formulas an Terms b. Fixing θ? c. About that Multinomial
More informationIterated Point-Line Configurations Grow Doubly-Exponentially
Iterate Point-Line Configurations Grow Doubly-Exponentially Joshua Cooper an Mark Walters July 9, 008 Abstract Begin with a set of four points in the real plane in general position. A to this collection
More informationQuantum Search on the Spatial Grid
Quantum Search on the Spatial Gri Matthew D. Falk MIT 2012, 550 Memorial Drive, Cambrige, MA 02139 (Date: December 11, 2012) This paper explores Quantum Search on the two imensional spatial gri. Recent
More informationSharp Thresholds. Zachary Hamaker. March 15, 2010
Sharp Threshols Zachary Hamaker March 15, 2010 Abstract The Kolmogorov Zero-One law states that for tail events on infinite-imensional probability spaces, the probability must be either zero or one. Behavior
More informationA Better Model for Job Redundancy: Decoupling Server Slowdown and Job Size
A Better Moel for Job Reunancy: Decoupling Server Slowown an Job Size Kristen Garner 1 Mor Harchol-Balter 1 Alan Scheller-Wolf Benny Van Hout 3 October 1 CMU-CS-1-131 School of Computer Science Carnegie
More informationTwo formulas for the Euler ϕ-function
Two formulas for the Euler ϕ-function Robert Frieman A multiplication formula for ϕ(n) The first formula we want to prove is the following: Theorem 1. If n 1 an n 2 are relatively prime positive integers,
More informationStopping-Set Enumerator Approximations for Finite-Length Protograph LDPC Codes
Stopping-Set Enumerator Approximations for Finite-Length Protograph LDPC Coes Kaiann Fu an Achilleas Anastasopoulos Electrical Engineering an Computer Science Dept. University of Michigan, Ann Arbor, MI
More informationOn Characterizing the Delay-Performance of Wireless Scheduling Algorithms
On Characterizing the Delay-Performance of Wireless Scheuling Algorithms Xiaojun Lin Center for Wireless Systems an Applications School of Electrical an Computer Engineering, Purue University West Lafayette,
More informationOptimization of Geometries by Energy Minimization
Optimization of Geometries by Energy Minimization by Tracy P. Hamilton Department of Chemistry University of Alabama at Birmingham Birmingham, AL 3594-140 hamilton@uab.eu Copyright Tracy P. Hamilton, 1997.
More informationLecture 2 Lagrangian formulation of classical mechanics Mechanics
Lecture Lagrangian formulation of classical mechanics 70.00 Mechanics Principle of stationary action MATH-GA To specify a motion uniquely in classical mechanics, it suffices to give, at some time t 0,
More informationOptimal Variable-Structure Control Tracking of Spacecraft Maneuvers
Optimal Variable-Structure Control racking of Spacecraft Maneuvers John L. Crassiis 1 Srinivas R. Vaali F. Lanis Markley 3 Introuction In recent years, much effort has been evote to the close-loop esign
More information2Algebraic ONLINE PAGE PROOFS. foundations
Algebraic founations. Kick off with CAS. Algebraic skills.3 Pascal s triangle an binomial expansions.4 The binomial theorem.5 Sets of real numbers.6 Surs.7 Review . Kick off with CAS Playing lotto Using
More informationMarkov Chains in Continuous Time
Chapter 23 Markov Chains in Continuous Time Previously we looke at Markov chains, where the transitions betweenstatesoccurreatspecifietime- steps. That it, we mae time (a continuous variable) avance in
More informationBEYOND THE CONSTRUCTION OF OPTIMAL SWITCHING SURFACES FOR AUTONOMOUS HYBRID SYSTEMS. Mauro Boccadoro Magnus Egerstedt Paolo Valigi Yorai Wardi
BEYOND THE CONSTRUCTION OF OPTIMAL SWITCHING SURFACES FOR AUTONOMOUS HYBRID SYSTEMS Mauro Boccaoro Magnus Egerstet Paolo Valigi Yorai Wari {boccaoro,valigi}@iei.unipg.it Dipartimento i Ingegneria Elettronica
More informationState-Space Model for a Multi-Machine System
State-Space Moel for a Multi-Machine System These notes parallel section.4 in the text. We are ealing with classically moele machines (IEEE Type.), constant impeance loas, an a network reuce to its internal
More informationLecture XII. where Φ is called the potential function. Let us introduce spherical coordinates defined through the relations
Lecture XII Abstract We introuce the Laplace equation in spherical coorinates an apply the metho of separation of variables to solve it. This will generate three linear orinary secon orer ifferential equations:
More informationPhase transitions related to the pigeonhole principle
Phase transitions relate to the pigeonhole principle Michiel De Smet an Anreas Weiermann Smisestraat 92 B 9000 Ghent Belgium ms@michielesmet.eu 2 Department of Mathematics Ghent University Builing S22
More information1 Definition of the derivative
Math 20A - Calculus by Jon Rogawski Chapter 3 - Differentiation Prepare by Jason Gais Definition of the erivative Remark.. Recall our iscussion of tangent lines from way back. We now rephrase this in terms
More informationConvergence of Random Walks
Chapter 16 Convergence of Ranom Walks This lecture examines the convergence of ranom walks to the Wiener process. This is very important both physically an statistically, an illustrates the utility of
More information