Now showing items 1-7 of 7

    • Compaction-Based Parallelization 

      Aiken, Alexander (Cornell University, 1988-06)
      We present a transformational system for extracting parallelism from programs. Our transformations generate code for synchronous parallel computers, such as Very Long Instruction Word and pipelined machines. The ...
    • The Complexity of Set Constraints 

      Aiken, Alexander; Kozen, Dexter; Vardi, Moshe; Wimmers, Ed (Cornell University, 1993-05)
      Set constraints are relations between sets of terms. They have been used extensively in various applications in program analysis and type inference. We present several results on the computational complexity of solving ...
    • Decidability of Systems of Set Constraints with Negative Constraints 

      Aiken, Alexander; Kozen, Dexter; Wimmers, Ed (Cornell University, 1993-06)
      Set constraints are relations between sets of terms. They have been used extensively in various applications in program analysis and type inference. Recently, several algorithms for solving general systems of positive ...
    • A Development Environment for Horizontal Microcode 

      Aiken, Alexander; Nicolau, Alexandru (Cornell University, 1986-09)
      This paper describes a development environment for horizontal microcode. The environment used Percolation Scheduling - a transformational system for parallelism extraction - and an interactive profiling system that gives ...
    • Loop Quantization: an Analysis and Algorithm 

      Aiken, Alexander; Nicolau, Alexandru (Cornell University, 1987-03)
      Loop unwinding is a well-known technique for reducing loop overhead, exposing parallelism, and increasing the efficiency of pipelining. Traditional loop unwinding is limited to the innermost loop of a set of nested loops ...
    • Optimal Loop Parallelization 

      Aiken, Alexander; Nicolau, Alexandru (Cornell University, 1988-03)
      Parallelizing compilers promise to exploit the parallelism available in a given program, particularly parallelism that is too low-level or irregular to be expressed by hand in an algorithm. However, existing parallelization ...
    • Perfect Pipelining: A New Loop Parallelization Technique 

      Aiken, Alexander; Nicolau, Alexandru (Cornell University, 1987-10)
      Parallelizing compilers do not handle loops in a satisfactory manner. Fine-grain transformations capture irregular parallelism inside a loop body not amenable to coarser approaches but have limited ability to exploit ...