Name
Title | ||
|---|---|---|
Heuristic Instruction Scheduling Algorithm Using Available Distance For Partial Forwarding Processor |
Abstract | ||
|---|---|---|
Partial forwarding is a design method to place forwarding paths on a part of processor pipeline. Hardware cost of processor can be reduced without performance loss by partial forwarding. However, compiler with the instruction scheduler which considers partial forwarding structure of the tan,et processor is required since conventional scheduling algorithm cannot make the most of partial forwarding structure. In this paper, we propose a heuristic instruction scheduling method for processors with partial forwarding structure. The proposed algorithm uses available distance to schedule instructions which are suitable for the target partial forwarding processor. Experimental results show that the proposed method generates near-optimal solutions in practical time and some of the optimized codes for partial forwarding processor run in the shortest time among the target processors. It also shows that the proposed method is superior to hazard detection unit. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1587/transfun.E92.A.3258 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | Field | DocType |
partial forwarding, instruction scheduling, compiler, design space exploration | Heuristic,Instruction scheduling,Instruction pipeline,Scheduling (computing),Computer science,Parallel computing,Algorithm,Compiler,Design space exploration | Journal |
Volume | Issue | ISSN |
E92A | 12 | 0916-8508 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Takuji Hieda | 1 | 25 | 4.14 |
| Hiroaki Tanaka | 2 | 0 | 0.34 |
| Keishi Sakanushi | 3 | 106 | 16.64 |
| Yoshinori Takeuchi | 4 | 250 | 48.18 |
| Masaharu Imai | 5 | 527 | 82.65 |