Scheduling series-parallel task graphs to minimize peak memory (Q1685958): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2017.09.037 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2685149245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON SCHEDULING SERIES-PARALLEL DAGs TO MAXIMIZE AREA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel recognition of series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling UET-UCT series-parallel graphs on two processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Pebbling Problem is Complete in Polynomial Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memory-optimal evaluation of expression trees involving large objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the storage requirement in the out-of-core multifrontal method for sparse factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Adaptive General Sparse Out-Of-Core Cholesky Factorization Scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Generalized Tree Pebbling to Sparse Matrix Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min Cut is NP-complete for edge weighted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing with Series-Parallel Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encyclopedia of Parallel Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4066569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Generation of Optimal Code for Arithmetic Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutwidth I: A linear time fixed parameter algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Recognition of Series Parallel Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of Treewidth and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for the min-cut linear arrangement of trees / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2017.09.037 / rank
 
Normal rank

Latest revision as of 03:25, 11 December 2024

scientific article
Language Label Description Also known as
English
Scheduling series-parallel task graphs to minimize peak memory
scientific article

    Statements

    Scheduling series-parallel task graphs to minimize peak memory (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 December 2017
    0 references
    series-parallel graphs
    0 references
    scheduling
    0 references
    peak memory minimization
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references