| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652720 | Electronic Notes in Discrete Mathematics | 2010 | 8 Pages |
Abstract
This paper deals, to some extent, with the problem of speculative data prefetching for dataflow programming models. We focus on finding optimum prefetch strategies for a simple n-way dataflow branching structure with respect to several objective functions and exhibit polynomial algorithms for doing so.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
