Sciweavers

    1536 search results - page 3 / 308
    » DPS - Dynamic Parallel Schedules
    Sort
    View
    COR
    2011
    247views Applied Computing» more  COR 2011»
    Size-reduction heuristics for the unrelated parallel machines scheduling problem
    15 years 1 months ago
    Size-reduction heuristics for the unrelated parallel machines scheduling problem
    Download  www.upv.es
    In this paper we study the unrelated parallel machines problem where n independent jobs must be assigned to one out of m parallel machines and the processing time of each job di�...
    Luis Fanjul-Peyro, Rubén Ruiz
    claim paper
    Read More »
    FGCS
    2010
    131views more  FGCS 2010»
    Time and cost trade-off management for scheduling parallel applications on Utility Grids
    15 years 1 months ago
    Time and cost trade-off management for scheduling parallel applications on Utility Grids
    Download  www.engr.colostate.edu
    Saurabh Kumar Garg, Rajkumar Buyya, Howard Jay Sie...
    claim paper
    Read More »
    HPCA
    2011
    IEEE
    248views Distributed And Parallel Com...» more  HPCA 2011»
    Bloom Filter Guided Transaction Scheduling
    14 years 10 months ago
    Bloom Filter Guided Transaction Scheduling
    Download  eecs.umich.edu
    Contention management is an important design component to a transactional memory system. Without effective contention management to ensure forward progress, a transactional memory...
    Geoffrey Blake, Ronald G. Dreslinski, Trevor N. Mu...
    claim paper
    Read More »
    IPPS
    1998
    IEEE
    111views Distributed And Parallel Com...» more  IPPS 1998»
    Evolving Processes and Evolution Schedulers for Concurrent Scheduling Controls and Parallel Evolutionary Computation
    15 years 10 months ago
    Evolving Processes and Evolution Schedulers for Concurrent Scheduling Controls and Parallel Evolutionary Computation
    Download  ipdps.cc.gatech.edu
    Tzilla Elrad, Jinlong Lin
    claim paper
    Read More »
    JSSPP
    1998
    Springer
    102views Distributed And Parallel Com...» more  JSSPP 1998»
    Improving First-Come-First-Serve Job Scheduling by Gang Scheduling
    15 years 10 months ago
    Improving First-Come-First-Serve Job Scheduling by Gang Scheduling
    Download  www-ds.e-technik.uni-dortmund.de
    Abstract. We present a new scheduling method for batch jobs on massively parallel processor architectures. This method is based on the First
    Uwe Schwiegelshohn, Ramin Yahyapour
    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.