A constructive method for exploiting code motion

L.C. Villar dos Santos, M.J.M. Heijligers, C.A.J. Eijk, van, J.T.J. Eijndhoven, van, J.A.G. Jess

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

3 Citaten (Scopus)

Samenvatting

In this paper we address a resource-constrained optimization problem for behavioral descriptions containing conditionals. In high-level synthesis of ASICs or in code generation for ASIPs, most methods use greedy choices in such a way that the search space is limited by the applied heuristics. For example, they might miss opportunities to optimize across basic block boundaries when treating conditional execution. We propose an approach based on local search and present a constructive method to allow unrestricted types of code motion, while keeping optimal solutions in the search space. A code-motion pruning technique is presented for cost functions optimizing schedule lengths. A technique for treating concurrent flows of execution is also described.
Originele taal-2Engels
TitelProc. IEEE/ACM Symposium on System Synthesis, La Jolla, CA, 6 November 1996
Pagina's51-56
DOI's
StatusGepubliceerd - 1996
Evenementconference; Proc. IEEE/ACM Symposium on System Synthesis, La Jolla, CA, 6 November 1996 -
Duur: 1 jan 1996 → …

Congres

Congresconference; Proc. IEEE/ACM Symposium on System Synthesis, La Jolla, CA, 6 November 1996
Periode1/01/96 → …
AnderProc. IEEE/ACM Symposium on System Synthesis, La Jolla, CA, 6 November 1996

Vingerafdruk

Duik in de onderzoeksthema's van 'A constructive method for exploiting code motion'. Samen vormen ze een unieke vingerafdruk.

Citeer dit