Hamiltonian recurrence for ILP

DOI10.1007/BFB0002756MaRDI QIDQ4536956zbMATH OpenFDO

Authors Cristina Barrado, Jesús Labarta

Publication date 6 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0002756

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computing methodologies and applications (68U99)

Recommendations

• Optimal software pipelining under resource constraints
• Time optimal software pipelining of loops with control flows
• Software pipelining of loops by the method of modulo scheduling
• A unified framework for instruction scheduling and mapping for function units with structural hazards
• Code reorganization using the data dependence graph for vector-pipeline computers

Cited in

(7)

• Code reorganization using the data dependence graph for vector-pipeline computers
• A unified framework for instruction scheduling and mapping for function units with structural hazards
• Time optimal software pipelining of loops with control flows
• The Mersenne Low Hamming Combination Search problem can be reduced to an ILP problem
• Software pipelining of nested loops
• A first step towards time optimal software pipelining of loops with control flows
• Optimal software pipelining under resource constraints

This page was built for publication: Hamiltonian recurrence for ILP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536956)