Verimag

bibtex

@inproceedings{LM11,
    title = { Meeting Deadlines Cheaply },
    author = {Legriel, Julien and Maler, Oded},
    month = {Mai},
    year = {2011},
    booktitle = {ECRTS},
    team = {TEMPO},
    abstract = {We develop a computational framework for solving the problem of finding the cheapest configuration (in terms of the number of processors and their respective speeds) of a multiprocessor architecture on which a task graph can be scheduled within a given deadline. We then extend the problem in three orthogonal directions: taking communication volume into account, considering the case where a stream of instances of the task graph arrives periodically and reformulating the problem as a bi-criteria optimization for which we approximate the Pareto front. },
}

URL

PDF

Publication Sections


Contact | Site Map | Site powered by SPIP 3.0.26 + AHUNTSIC [CC License]

info visites 911984