Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time (Q3777447)

From MaRDI portal
Revision as of 07:08, 22 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
scientific article

    Statements

    Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time (English)
    0 references
    0 references
    0 references
    1988
    0 references
    expander graphs
    0 references
    optimal speed-up
    0 references
    scheduling
    0 references
    approximate reschedulings
    0 references
    PRAM algorithm
    0 references
    list ranking
    0 references

    Identifiers