Cost-Based Optimization of Integration Flows - Datenbanken ...
Cost-Based Optimization of Integration Flows - Datenbanken ...
Cost-Based Optimization of Integration Flows - Datenbanken ...
- No tags were found...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
5.4 Formal Analysis<br />
because E(k ′ ) = ∑ ∞<br />
i=1 k′ i · P (k′ = k i ′ ). In order to show that the latency constraint lc is,<br />
in expectation, not exceeded by skewed arrival rate distributions, we need to show that<br />
the effects <strong>of</strong> overestimation W (P ′ , k ′ − 1) − W (P ′ , k ′ ) (lower execution time) amortize<br />
the effects <strong>of</strong> underestimation W (P ′ , k ′ + 1) − W (P ′ , k ′ ) (higher execution time). The<br />
composed effect ∆W (P ′ ) is computed by<br />
∆W (P ′ ) = ( W (P ′ , k ′ − 1) − W (P ′ , k ′ ) ) + ( W (P ′ , k ′ + 1) − W (P ′ , k ′ ) )<br />
= ( W − (P ) + W + (P ) · (k ′ − 1) − (W − (P ) + W + (P ) · k ′ ) )<br />
(5.22)<br />
+ ( W − (P ) + W + (P ) · (k ′ + 1) − (W − (P ) + W + (P ) · k ′ ) ) = 0<br />
Thus, for the worst case, the condition T L (M ′ ) = lc holds in expectation. Hence, Theorem<br />
5.4 holds.<br />
This extended s<strong>of</strong>t guarantee <strong>of</strong> maximum latency holds for both right-skewed and leftskewed<br />
distributions functions due to the equal average over- and under-estimation. However,<br />
it is important to note that these guarantees <strong>of</strong> maximum latency are s<strong>of</strong>t constraints<br />
that hold, in expectation, and for non-overload situations, while changing workload characteristics<br />
in combination with a long optimization interval ∆t might lead to temporarily<br />
exceeding the latency constraint.<br />
5.4.3 Serialized External Behavior<br />
According to the requirement <strong>of</strong> serialized external behavior, we additionally might need<br />
to serialize messages at the outbound side. We analyze once again the given maximum<br />
latency guarantee with regard to arbitrary serialization concepts.<br />
Theorem 5.5 (Serialized Behavior). Theorems 5.3 (S<strong>of</strong>t Guarantee <strong>of</strong> Maximum Latency)<br />
and 5.4 (Extended S<strong>of</strong>t Guarantee <strong>of</strong> Maximum Latency) also hold for serialized external<br />
behavior.<br />
Pro<strong>of</strong>. We need to prove that the condition T L (m i ) ≤ ˆT L (M ′ ) ≤ lc is true even in the<br />
case, where we have to serialize the external behavior. Therefore, recall the worst case<br />
(Theorem 5.3), where the latency time is given by<br />
T L (m i ) = 1<br />
sel · ∆tw + W (P ′ , k ′ ). (5.23)<br />
In that case, the message m i has not outrun other messages such that no serialization time<br />
is required. For all other messages that exhibit a general latency time <strong>of</strong><br />
( ) 1<br />
T L (m i ) =<br />
sel − x · ∆tw + W (P ′ , k ′ ), (5.24)<br />
where x denotes the number <strong>of</strong> partitions after the partition <strong>of</strong> m i , this message has<br />
outrun at most x · k ′ messages. Thus, additional serialization time <strong>of</strong> x · ∆tw + W ∗ (P ′ , k ′ )<br />
is needed. In conclusion, we get<br />
( ) 1<br />
T L (m i ) =<br />
sel − x · ∆tw + W ∗ (P ′ , k ′ ) + x · ∆tw + W (P ′ , k ′ )<br />
= 1<br />
(5.25)<br />
sel · ∆tw + W (P ′ , k ′ ).<br />
155