Speculative data prefetching for branching structures in dataflow programms

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...

Full description

Saved in:
Bibliographic Details
Published in:Electronic notes in discrete mathematics 2010-08, Vol.36, p.119-126
Main Authors: Carpov, Sergiu, Sirdey, Renaud, Carlier, Jacques, Nace, Dritan
Format: Article
Language:English
Subjects:
Knapsack
OR in Compilation
Parallel Computing
Shortest Path
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1571-0653
1571-0653
DOI:10.1016/j.endm.2010.05.016