article · 1996

Combining code motion and scheduling

LC Villar dos Santos, van Jtj Jos Eijndhoven, Jag Jochen Jess

Cited by 8Abstract and details only

Abstract

This work addresses a resourceconstrained optimization problem which arises in the context of the high-level synthesis of an ASIC or in the code generation for an ASIP. For a given behavioral description containing conditional constructs, scheduling and code motion are combined and encoded in the form of a unified optimization problem. As taking code motion into account may lead to a larger search space, a code-motion pruning technique has been developed. Optimal solutions are kept in the search space and a local-search method is used to seek for potential solutions. We show that our technique can cope with issues like speculative execution and code duplication. Moreover, it can be extended to tackle constraints imposed by the advance choice of a controller, such as pipelined-control delay and limited branch capabilities. For all cases tested so far, our experimental results have reached the best published results. Keywords--- high-level synthesis, code generation, scheduling, code mo...

Cite this paper

APA 7

dos Santos, L. V., Eijndhoven, V. J. J., & Jess, J. J. (1996). Combining code motion and scheduling.

MLA 9

dos Santos, LC Villar, et al. “Combining code motion and scheduling.” 1996.

Chicago

dos Santos, LC Villar, van Jtj Jos Eijndhoven, and Jag Jochen Jess. 1996. “Combining code motion and scheduling.”

Harvard

dos Santos, L.V., Eijndhoven, V.J.J. and Jess, J.J. (1996) ‘Combining code motion and scheduling’.

BibTeX

@article{dossantos1996combining,
  title = {{Combining code motion and scheduling}},
  author = {dos Santos, LC Villar and Eijndhoven, van Jtj Jos and Jess, Jag Jochen},
  year = {1996}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.