
- 1 E. Aarts and E. Korst. Simulated Annealing and Boltz. mann Machines. John Wiley & Sons, 1990. Google Scholar
Digital Library
- 2 A. Aiken and A. Nicolau. Perfect pipelining: a new loop parallelization technique. Technical Report 87- 873, Dept. of CS, CorneU University, 1987.Google Scholar
- 3 S. Beaty. Genetic algorithms and instruction scheduling. In Proc. of MICRO~4, 1991. Google Scholar
Digital Library
- 4 A. De Gloria and P. Faraboschi. A boltzmann machine approach to code optimization. Parallel Computing, 17:969-982, Dec. 1991.Google Scholar
Digital Library
- 5 A. De Gloria, P. Faraboschi, and S. Ridella. A dedicared massively parallel architecture for the boltzmann machine. Parallel Computing, 18:57-73, Jan. 1992.Google Scholar
Cross Ref
- 6 K. Ebcioglu. A compilation technique for software pipelining of loops with conditional jumps. In Proc. of MICRO~O, 1987. Google Scholar
Digital Library
- 7 D. Jacobs, P. Siegel, and K. Wilson. Monte carlo techniques in code optimization. In Proc. of MICRO15, 1982. Google Scholar
Digital Library
- 8 M. Lam. A Systolic Array Optimizing Compiler. PhD thesis, Carnegie Mellon University, 1987. Google Scholar
Digital Library
- 9 D. Landskov, S. Davidson, and B. Shriver. Local microcode compaction techniques. A CM Comput. Survey, 12, Sept. 1980. Google Scholar
Digital Library
- 10 B. Rau, C. Glaeser, and R. Picard. Efficient code generation for horizontal architectures: compiler techniques and architectural support. In Proc. of 9th ISCA, pages 131-139, 1982. Google Scholar
Digital Library
- 11 B. Su and J. Wang. Gurpr*: A new global software pipelining algorithm. In Proc. of MICRO~4, 1991. Google Scholar
Digital Library
Index Terms
A non-deterministic scheduler for a software pipelining compiler
Recommendations
Deterministic Pushdown Automata and Unary Languages
CIAA '08: Proceedings of the 13th international conference on Implementation and Applications of AutomataThe simulation of deterministic pushdown automata defined over a one letter alphabet by finite state automata is investigated from a descriptional complexity point of view. We show that each unary deterministic pushdown automaton of size s can be ...
Wave-pipelining: a tutorial and research survey
Wave-pipelining is a method of high-performance circuit design which implements pipelining in logic without the use of intermediate latches or registers. The combination of high-performance integrated circuit (IC) technologies, pipelined architectures, ...
A compiler for deterministic, decomposable negation normal form
Eighteenth national conference on Artificial intelligenceWe present a compiler for converting CNF formulas into deterministic, decomposable negation normal form (d-DNNF). This is a logical form that has been identified recently and shown to support a number of operations in polynomial time, including clausal ...






Comments