904 search results - page 138 / 181 » Scheduling task graphs optimally with A |
DASFAA
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract. Privacy becomes a major concern for both customers and enterprises in today’s corporate marketing strategies, many research efforts have been put into developing new p...
CGO
2005
IEEE
14 years 2 months ago
2005
IEEE
Data speculative optimization refers to code transformations that allow load and store instructions to be moved across potentially dependent memory operations. Existing research w...
HICSS
1995
IEEE
14 years 10 days ago
1995
IEEE
Abstract. We reexamine the limits of parallelism available in programs, using runtime reconstruction of program data-flow graphs. While limits of parallelism have been examined in...
ISSS
2000
IEEE
14 years 1 months ago
2000
IEEE
This paper addresses the problem of estimating lower bounds on the power consumption in scheduled data flow graphs with a fixed number of allocated resources prior to binding. T...
EUROPAR
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Limited bandwidth to off-chip main memory is a performance bottleneck in chip multiprocessors for streaming computations, such as Cell/B.E., and this will become even mor...