204 search results - page 16 / 41 » Provable algorithms for parallel generalized sweep schedulin... |
111
click to vote
SPAA
2010
ACM
14 years 12 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
308
click to vote
DAC
2012
ACM
13 years 2 months ago
2012
ACM
Loop pipelining is a critical transformation in behavioral synthesis. It is crucial to producing hardware designs with acceptable latency and throughput. However, it is a complex ...
ICCAD
2006
IEEE
15 years 8 months ago
2006
IEEE
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
IPPS
2005
IEEE
15 years 5 months ago
2005
IEEE
Pfair scheduling, currently the only known way of optimally scheduling recurrent real-time tasks on multiprocessors, imposes certain requirements that may limit its practical impl...
HPDC
2007
IEEE
15 years 6 months ago
2007
IEEE
Utility functions can be used to represent the value users attach to job completion as a function of turnaround time. Most previous scheduling research used simple synthetic repre...