1-optimality of static BSP computations: Scheduling independent chains as a case study. (Q1401163)

From MaRDI portal
Revision as of 15:15, 20 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
1-optimality of static BSP computations: Scheduling independent chains as a case study.
scientific article

    Statements

    1-optimality of static BSP computations: Scheduling independent chains as a case study. (English)
    0 references
    0 references
    0 references
    0 references
    17 August 2003
    0 references
    Scheduling
    0 references
    Synchronization
    0 references
    Chains
    0 references
    BSP
    0 references

    Identifiers