Journal Article

Speculative data prefetching for branching structures in dataflow programms

Electronic Notes in Discrete Mathematics (2010) 36(C) 119-126
DOI: 10.1016/j.endm.2010.05.016
0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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. © 2010 Elsevier B.V.

Author supplied keywords

Cite

CITATION STYLE

APA

Carpov, S., Sirdey, R., Carlier, J., & Nace, D. (2010). Speculative data prefetching for branching structures in dataflow programms. Electronic Notes in Discrete Mathematics, 36(C), 119–126. https://doi.org/10.1016/j.endm.2010.05.016

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free