@inproceedings{10.1109/SCCC.2008.8,
    abstract = "In this paper we present a scheduling algorithm that assigns tasks of medium size grain. The behavior of the proposed algorithm, called Extended Latency Time (ELT), is compared with the Dominant Sequence Clustering (DSC) algorithm. One of the inputs values required by the ELT algorithm is the maximum number of processors available in the architecture. This value corresponds to the number of processors used by DSC for the same DAG (Directed Acyclic Graph), but ELT uses no more processors than necessary. Although ELT algorithm was specifically designed for assigning fine grained DAGs, results show that the number of processors used by ELT for the assignment of medium grained DAGs is, at most, the same number as used by DSC. When comparing the results for each algorithm in terms of average CPU use, the proposed ELT algorithm is superior in 100\% of the cases, so that the performance in terms of CPU use is always lower for DSC. © 2008 IEEE.",
    year = "2008",
    title = "A scheduling algorithm to optimize parallel processes",
    pages = "73-78",
    doi = "10.1109/SCCC.2008.8",
    journal = "Proceedings - International Conference of the Chilean Computer Science Society, SCCC",
    author = "Solar, Mauricio"
}

{"_id":"FxrhyR9tiMnQgSfjt","bibbaseid":"solar-aschedulingalgorithmtooptimizeparallelprocesses-2008","downloads":0,"creationDate":"2017-04-03T15:16:25.912Z","title":"A scheduling algorithm to optimize parallel processes","author_short":["Solar, M."],"year":2008,"bibtype":"inproceedings","biburl":"https://1fichier.com/?yjj84y68k0","bibdata":{"bibtype":"inproceedings","type":"inproceedings","abstract":"In this paper we present a scheduling algorithm that assigns tasks of medium size grain. The behavior of the proposed algorithm, called Extended Latency Time (ELT), is compared with the Dominant Sequence Clustering (DSC) algorithm. One of the inputs values required by the ELT algorithm is the maximum number of processors available in the architecture. This value corresponds to the number of processors used by DSC for the same DAG (Directed Acyclic Graph), but ELT uses no more processors than necessary. Although ELT algorithm was specifically designed for assigning fine grained DAGs, results show that the number of processors used by ELT for the assignment of medium grained DAGs is, at most, the same number as used by DSC. When comparing the results for each algorithm in terms of average CPU use, the proposed ELT algorithm is superior in 100% of the cases, so that the performance in terms of CPU use is always lower for DSC. © 2008 IEEE.","year":"2008","title":"A scheduling algorithm to optimize parallel processes","pages":"73-78","doi":"10.1109/SCCC.2008.8","journal":"Proceedings - International Conference of the Chilean Computer Science Society, SCCC","author":[{"propositions":[],"lastnames":["Solar"],"firstnames":["Mauricio"],"suffixes":[]}],"bibtex":"@inproceedings{10.1109/SCCC.2008.8,\n abstract = \"In this paper we present a scheduling algorithm that assigns tasks of medium size grain. The behavior of the proposed algorithm, called Extended Latency Time (ELT), is compared with the Dominant Sequence Clustering (DSC) algorithm. One of the inputs values required by the ELT algorithm is the maximum number of processors available in the architecture. This value corresponds to the number of processors used by DSC for the same DAG (Directed Acyclic Graph), but ELT uses no more processors than necessary. Although ELT algorithm was specifically designed for assigning fine grained DAGs, results show that the number of processors used by ELT for the assignment of medium grained DAGs is, at most, the same number as used by DSC. When comparing the results for each algorithm in terms of average CPU use, the proposed ELT algorithm is superior in 100\\% of the cases, so that the performance in terms of CPU use is always lower for DSC. © 2008 IEEE.\",\n year = \"2008\",\n title = \"A scheduling algorithm to optimize parallel processes\",\n pages = \"73-78\",\n doi = \"10.1109/SCCC.2008.8\",\n journal = \"Proceedings - International Conference of the Chilean Computer Science Society, SCCC\",\n author = \"Solar, Mauricio\"\n}\n\n","author_short":["Solar, M."],"key":"10.1109/SCCC.2008.8","id":"10.1109/SCCC.2008.8","bibbaseid":"solar-aschedulingalgorithmtooptimizeparallelprocesses-2008","role":"author","urls":{},"downloads":0},"search_terms":["scheduling","algorithm","optimize","parallel","processes","solar"],"keywords":[],"authorIDs":[],"dataSources":["mqyNxb9twi6rYAXFv"]}