Predictability of load/store instruction latencies
- 1 January 1993
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Presents a model of coarse grain dataflow execution. The authors present one top down and two bottom up methods for generation of multithreaded code, and evaluate their effectiveness. The bottom up techniques start from a fine-grain dataflow graph and coalesce this into coarse-grain clusters. The top down technique generates clusters directly from the intermediate data dependence graph used for compiler optimizations. The authors discuss the relevant phases in the compilation process. They compare the effectiveness of the strategies by measuring the total number of clusters executed, the total number of instructions executed, cluster size, and number of matches per cluster. It turns out that the top down method generates more efficient code, and larger clusters. However the number of matches per cluster is larger for the top down method, which could incur higher cluster synchronization costs.<>Keywords
This publication has 14 references indexed in Scilit:
- Active Messages: A Mechanism for Integrated Communication and ComputationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Toward a dataflow/von Neumann hybrid architecturePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Monsoon: an explicit token-store architecturePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Generation and quantitative evaluation of dataflow clustersPublished by Association for Computing Machinery (ACM) ,1993
- TPublished by Association for Computing Machinery (ACM) ,1992
- Fine-grain parallelism with minimal hardware support: a compiler-controlled threaded abstract machinePublished by Association for Computing Machinery (ACM) ,1991
- Multi-thread code generation for dataflow architectures from non-strict programsPublished by Springer Nature ,1991
- The explicit token storeJournal of Parallel and Distributed Computing, 1990
- Iterative instructions in the Manchester Dataflow ComputerIEEE Transactions on Parallel and Distributed Systems, 1990
- Code optimization for tagged-token dataflow machinesIEEE Transactions on Computers, 1989