Title of article
Speculative data prefetching for branching structures in dataflow programms
Author/Authors
Carpov، نويسنده , , Sergiu and Sirdey، نويسنده , , Renaud and Carlier، نويسنده , , Jacques and Nace، نويسنده , , Dritan، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
8
From page
119
To page
126
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.
Keywords
Knapsack , shortest path , Parallel computing , OR in Compilation
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2010
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455367
Link To Document