@inproceedings{84956858682,
    abstract = "© Springer-Verlag Berlin Heidelberg 2002.This paper presents a static scheduler to carry out the best assignment of a Directed Acyclic Graph (DAG) representing an application program. Some characteristics of the DAG, a decision model, and the evaluation parameters for choosing the best solution provided by the selected scheduling algorithms are defined. The selection of the scheduling algorithms is based on five decision levels. At each level, a subset of scheduling algorithms is selected. When the scheduler was tested with a series of DAGs having different characteristics, the scheduler’s decision was right 100\% of the time in those cases in which the number of available processors is known.",
    year = "2002",
    title = "An automatic scheduler for parallel machines",
    volume = "2400",
    pages = "212-216",
    booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    author = "Solar, Mauricio and Inostroza, Mario"
}

{"_id":"7fTLeqWYuAiLPXi3i","bibbaseid":"solar-inostroza-anautomaticschedulerforparallelmachines-2002","downloads":0,"creationDate":"2017-04-03T15:16:25.898Z","title":"An automatic scheduler for parallel machines","author_short":["Solar, M.","Inostroza, M."],"year":2002,"bibtype":"inproceedings","biburl":"https://1fichier.com/?yjj84y68k0","bibdata":{"bibtype":"inproceedings","type":"inproceedings","abstract":"© Springer-Verlag Berlin Heidelberg 2002.This paper presents a static scheduler to carry out the best assignment of a Directed Acyclic Graph (DAG) representing an application program. Some characteristics of the DAG, a decision model, and the evaluation parameters for choosing the best solution provided by the selected scheduling algorithms are defined. The selection of the scheduling algorithms is based on five decision levels. At each level, a subset of scheduling algorithms is selected. When the scheduler was tested with a series of DAGs having different characteristics, the scheduler’s decision was right 100% of the time in those cases in which the number of available processors is known.","year":"2002","title":"An automatic scheduler for parallel machines","volume":"2400","pages":"212-216","booktitle":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","author":[{"propositions":[],"lastnames":["Solar"],"firstnames":["Mauricio"],"suffixes":[]},{"propositions":[],"lastnames":["Inostroza"],"firstnames":["Mario"],"suffixes":[]}],"bibtex":"@inproceedings{84956858682,\n abstract = \"© Springer-Verlag Berlin Heidelberg 2002.This paper presents a static scheduler to carry out the best assignment of a Directed Acyclic Graph (DAG) representing an application program. Some characteristics of the DAG, a decision model, and the evaluation parameters for choosing the best solution provided by the selected scheduling algorithms are defined. The selection of the scheduling algorithms is based on five decision levels. At each level, a subset of scheduling algorithms is selected. When the scheduler was tested with a series of DAGs having different characteristics, the scheduler’s decision was right 100\\% of the time in those cases in which the number of available processors is known.\",\n year = \"2002\",\n title = \"An automatic scheduler for parallel machines\",\n volume = \"2400\",\n pages = \"212-216\",\n booktitle = \"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)\",\n author = \"Solar, Mauricio and Inostroza, Mario\"\n}\n\n","author_short":["Solar, M.","Inostroza, M."],"key":"84956858682","id":"84956858682","bibbaseid":"solar-inostroza-anautomaticschedulerforparallelmachines-2002","role":"author","urls":{},"downloads":0},"search_terms":["automatic","scheduler","parallel","machines","solar","inostroza"],"keywords":[],"authorIDs":[],"dataSources":["mqyNxb9twi6rYAXFv"]}