Exploiting fine-grain parallelism on dataflow architectures

DOI10.1016/0167-8191(90)90134-UMaRDI QIDQ910200zbMATH OpenFDO

Authors Guang R. Gao

Publication date 1990

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(90)90134-U

zbMATH Keywords

applicative languagesdataflow architecturesdataflow compilerdataflow software pipeliningprogram structure analysis

Mathematics Subject Classification ID

Theory of operating systems (68N25) Theory of software (68N99)

Recommendations

• Maximum Pipelining Of Array Computation: A Pipelined Code Mapping Scheme For Dataflow Computers
• scientific article; zbMATH DE number 561556
• A note on compiling FORTRAN loop kernels onto a dataflow architecture
• scientific article; zbMATH DE number 4016162
• scientific article; zbMATH DE number 4064454

Cited in

(6)

• Realizing the parallelism of array-based computation
• A note on compiling FORTRAN loop kernels onto a dataflow architecture
• scientific article; zbMATH DE number 4016162 (Why is no real title available?)
• Maximum Pipelining Of Array Computation: A Pipelined Code Mapping Scheme For Dataflow Computers
• scientific article; zbMATH DE number 561556 (Why is no real title available?)
• \(D^{3}\)-Machine: A decoupled data-driven multithreaded architecture with variable resolution support

This page was built for publication: Exploiting fine-grain parallelism on dataflow architectures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q910200)