Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

On Scheduling Task-Graphs to LogP-Machines with Disturbances

Welf LöweContact Information and Wolf ZimmermannContact Information

(5)  School of Mathematics and Systems Engineering Software Tech. Group, Växjö University, S-351 95 Växjö, Sweden
(6)  Institut für Informatik, Martin-Luther-Universität Halle-Wittenberg, D-06099 Halle/Saale, Germany
Abstract
We consider the problem of scheduling task-graphs to LogP-machines when the execution of the schedule may be delayed. If each time step in the schedule is delayed with a certain probability, we show that under LogP the expected execution time for a schedule s is at most $$
\mathcal{O}
$$ (TIME(s) where TIME(s) is the makespan of the schedule s.

Contact Information Welf Löwe
Email: Welf.Lowe@msi.vxu.se

Contact Information Wolf Zimmermann
Email: zimmer@informatik.uni-halle.de
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.109 • Server: mpweb02
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)