Sciweavers

    EOR
    2008
    52views more  EOR 2008»
    Competitive online scheduling of perfectly malleable jobs with setup times
    13 years 6 months ago
    Competitive online scheduling of perfectly malleable jobs with setup times
    Download  www.denison.edu
    We study how to efficiently schedule online perfectly malleable parallel jobs with arbitrary arrival times on m 2 processors. We take into account both the linear speedup of such...
    Jessen T. Havill, Weizhen Mao
    claim paper
    Read More »
    STOC
    1999
    ACM
    106views Algorithms» more  STOC 1999»
    Scheduling in the Dark
    13 years 11 months ago
    Scheduling in the Dark
    Download  www.cse.yorku.ca
    We considered non-clairvoyant multiprocessor scheduling of jobs with arbitrary arrival times and changing execution characteristics. The problem has been studied extensively when ...
    Jeff Edmonds
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.