Skip to main content
SpringerLink
Log in

Data dependence in simple and compound program pipelines

  • Cybernetics
  • Published:
Cybernetics and Systems Analysis Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. V. A. Evstigneev, “Some features of software for long instruction word computers: a survey,” Programmirovanie, No. 2, 69–80 (1991).

    MATH  Google Scholar 

  2. G. I. Shpakovskii, “Trace scheduling method and long instructions word computer architectures,” Zarub. Radioelektr., No. 11, 10–27 (1991).

    Google Scholar 

  3. B. A. Babayan, A. V. Bocharov, et al., “Multiprocessor computers and their design methods,” in: Yu. M. Smirnov (ed.), Future Development of Computer Engineering, A Handbook [in Russian], vol. 4, Vysshaya Shkola, Moscow (1990).

    Google Scholar 

  4. A. Aiken, Compaction-Based Parallelizaition PhD Thesis, Cornell Univ., Dept. Comp. Sci. Tech. Rep. 88-922 (June 1988).

  5. A. Aiken, “A theory of compaction based parallelization,” Theor. Comp. Sci.,73, 121–154 (1990).

    Article  MATH  MathSciNet  Google Scholar 

  6. K. Ebcioglu and T. Nakatani, “A new compilation technique for parallelizing loops with unpredictable branches on VLIW architecture,” in: Languages and Compilers for Parallel Computing, Pitman, London (1990), pp. 213–229.

    Google Scholar 

  7. J. A. Fisher, “Trace scheduling: a technique for global microcode compaction,” IEEE Trans. Comput.,C-30, No. 7, 478–490 (1981).

    Google Scholar 

  8. J. A. Fisher, “VLIW architecture: supercomputing via overlapped execution,” in: 2nd Int. Conf. on Supercomputing, May 3–8, 1987, Santa Clara, CA (1987).

  9. A. Nicolau, Percolation Scheduling: A Parallel Compilation Technique, Cornell Univ., Dept. Comp. Sci. Tech. Rep. TR 85-678 (1985).

  10. R. Gupta, A Reconfigurable LIW Architecture and Its Compiler, Univ. of Pittsburgh, Tech. Rep. 87-3 (1987).

  11. A. Nicolau, Loop Quantization, or Unwinding Done Right, Cornell Univ., Tech. Rep. 85-709 (1985).

  12. J. R. Ellis, BULLDOG: A Compiler for VLIW Architectures, MIT Press, Cambridge, MA (1986).

    Google Scholar 

  13. J. A. Fisher, “Very long instruction word architectures and ELI-512,” in: Proc. 10th Symp. on Compiler Architectures, IEEE (June 1983), pp. 140–150.

  14. D. J. Kuck, A. H. Sameh, R. Cytron, et al., “The effects of program restructuring, algorithm change, and architecture choice on program performance,” Proc. 1984 Int. Conf. on Parallel Processing, IEEE Computer Society Press, Washington, DC (August 1984), pp. 129–138.

    Google Scholar 

  15. U. Banerjee, Data Dependence in Ordinary Programs, MS Thesis, Univ. of Illinois at Urbana-Champaign, Dept. Comput. Sci. Rep. No. 76-837 (Nov. 1976).

  16. M. J. Wolfe, Optimizing Supercomputers for Supercomputers, MIT Press, Cambridge, MA (1989).

    Google Scholar 

  17. R. Allen and K. Kennedy, “Automatic compiling of FORTRAN programs in vector form,” in: Program Vectorization: Theory, Methods, Implementation [Russian translations from English and German], Mir, Moscow (1991), pp. 77–140.

    Google Scholar 

Download references

Authors
  1. A. P. Kovtushenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 62–75, July–August, 1995.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kovtushenko, A.P. Data dependence in simple and compound program pipelines. Cybern Syst Anal 31, 531–542 (1995). https://doi.org/10.1007/BF02366408

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02366408

Keywords

Search

Navigation