With careful technical analysis we can show that some of them will have an arbitrarily large delay. For instances with c ac p we show that any template schedule such that {task(e, k)|0 ac k alt; Ip} = Te guarantees a limit of p Am Di for each task Ii.

Title | : | Algorithms and Computation |

Author | : | Otfried Cheong, Kyung-Yong Chwa, Kunsoo Park |

Publisher | : | Springer - 2010-12-06 |

Continue