108 search results - page 7 / 22 » A Lower Bound for Dynamic Scheduling of Data Parallel Progra... |
ASPDAC
2006
ACM
14 years 1 months ago
2006
ACM
Recent research results have seen the application of parallelizing techniques to high-level synthesis. In particular, the effect of speculative code transformations on mixed contr...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
GLOBECOM
2007
IEEE
14 years 1 months ago
2007
IEEE
—Recharging the batteries of a moribund sensor deployed as part of a wireless sensor network is often infeasible due to logistical considerations. With the purpose of prolonging ...
ICDCS
2000
IEEE
13 years 12 months ago
2000
IEEE
Providing up-to-date input to users’ applications is an important data management problem for a distributed computing environment, where each data storage location and intermedi...
TAPAS
2011
13 years 2 months ago
2011
Abstract. We consider energy-performance tradeoff for scheduling parallel jobs on multiprocessors using dynamic speed scaling. The objective is to minimize the sum of energy consu...