Sciweavers

1536 search results - page 41 / 308
» DPS - Dynamic Parallel Schedules
Sort
View
WAOA
2010
Springer
237views Algorithms» more  WAOA 2010»
14 years 9 months ago
Lower Bounds for Smith's Rule in Stochastic Machine Scheduling
We consider the problem to minimize the weighted sum of completion times in nonpreemptive parallel machine scheduling. In a landmark paper from 1986, Kawaguchi and Kyan [5] showed ...
Caroline Jagtenberg, Uwe Schwiegelshohn, Marc Uetz
ISCA
2012
IEEE
260views Hardware» more  ISCA 2012»
13 years 1 months ago
A case for exploiting subarray-level parallelism (SALP) in DRAM
Modern DRAMs have multiple banks to serve multiple memory requests in parallel. However, when two requests go to the same bank, they have to be served serially, exacerbating the h...
Yoongu Kim, Vivek Seshadri, Donghyuk Lee, Jamie Li...
SPAA
2009
ACM
15 years 6 months ago
Scheduling to minimize staleness and stretch in real-time data warehouses
MohammadHossein Bateni, Lukasz Golab, Mohammad Tag...
IPPS
2009
IEEE
15 years 5 months ago
On reducing misspeculations in a pipelined scheduler
Ruben Gran Tejero, Enric Morancho, Àngel Ol...