Venugopal, R and Srikant, YN (1993) Heuristic chaining in directed acyclic graphs. In: Computer Languages, 19 (3). pp. 169-184.
Restricted to Registered users only
Download (897Kb) | Request a copy
In this paper we look at the problem of generating code with instruction chaining from directed acyclic graphs (DAGs). The problem is shown to be NP-complete. A simple heuristic for the problem is devised and its performance is compared with existing methods. The heuristic is shown to generate good code especially when the number of registers is large. Also described is an extension to the heuristic which improves the code for a small number of registers.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to Elsevier.|
|Keywords:||RISC;Vector processing;Instruction chaining;Code generation;Directed acyclic graphs|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||27 Sep 2006|
|Last Modified:||19 Sep 2010 04:31|
Actions (login required)