Dynamic dependency analysis of ordinary programs
暂无分享,去创建一个
[1] Alexandru Nicolau,et al. Measuring the Parallelism Available for Very Long Instruction Word Architectures , 1984, IEEE Transactions on Computers.
[2] David W. Wall,et al. Limits of instruction-level parallelism , 1991, ASPLOS IV.
[3] Manoj Kumar,et al. Measuring Parallelism in Computation-Intensive Scientific/Engineering Applications , 1988, IEEE Trans. Computers.
[4] Michael D. Smith,et al. Limits on multiple instruction issue , 1989, ASPLOS III.
[5] Arvind,et al. The Evolution of Dataflow Architectures: from Static Dataflow to P-RISC , 1993, Int. J. High Speed Comput..
[6] Rishiyur S. Nikhil. The Parallel Programming Language Id and its Compilation for Parallel Machines , 1993, Int. J. High Speed Comput..
[7] David E. Culler,et al. Resource requirements of dataflow programs , 1988, [1988] The 15th Annual International Symposium on Computer Architecture. Conference Proceedings.
[8] David E. Culler,et al. The Explicit Token Store , 1990, J. Parallel Distributed Comput..
[9] Michael J. Flynn,et al. Detection and Parallel Execution of Independent Instructions , 1970, IEEE Transactions on Computers.
[10] Yoichi Muraoka,et al. Measurements of parallelism in ordinary FORTRAN programs , 1974, Computer.
[11] Gregory M. Papadopoulos,et al. Implementation of a general purpose dataflow multiprocessor , 1991 .
[12] Y. Patt,et al. Single instruction stream parallelism is greater than two , 1991, [1991] Proceedings. The 18th Annual International Symposium on Computer Architecture.
[13] David E. Culler,et al. Assessing the Benefits of Fine- Grain Parallelism in Dataflow Programs , 1988 .