Sciweavers

    118
    Voted
    EUROPAR
    1998
    Springer
    94views Distributed And Parallel Com...» more  EUROPAR 1998»
    A Lower Bound for Dynamic Scheduling of Data Parallel Programs
    15 years 7 months ago
    A Lower Bound for Dynamic Scheduling of Data Parallel Programs
    Download  www-asim.lip6.fr
    Instruction Balanced Time Slicing IBTS allows multiple parallel jobs to be scheduled in a manner akin to the well-known gang scheduling scheme in parallel computers. IBTS however a...
    Fabrício Alves Barbosa da Silva, Luis Migue...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.