MODELING OF SUPERSCALAR INSTRUCTION SCHEDULING AND ANALYSIS OF A HEURISTIC SCHEDULING ALGORITHM
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
371 | en_US |
dc.citation.issue |
3 | en_US |
dc.citation.spage |
354 | en_US |
dc.citation.volume |
33 | en_US |
dc.citation.woscount |
0 | |
dc.contributor.author |
CHOU, HC | en_US |
dc.contributor.author |
CHUNG, CP | en_US |
dc.contributor.department |
資訊科學與工程研究所 | zh_TW |
dc.contributor.department |
Institute of Computer Science and Engineering | en_US |
dc.date.accessioned |
2014-12-08T15:04:42Z | |
dc.date.available |
2014-12-08T15:04:42Z | |
dc.date.issued |
1993 | en_US |
dc.description.abstract |
The problem of superscalar instruction scheduling is studied and an analysis of a heuristic scheduling algorithm is presented. First, a superscalar architecture is characterized by k, the number of types of functional units employed, m(i), the number of type i functional units, P(ij), the jth functional unit of type i, and z, the maximal number of delay cycles incurred by the execution of instructions. A program trace to be scheduled is modeled by a directed acyclic graph with delay on precedence relations. These two models reflect most of the flavor of the superscalar instruction scheduling problem. A heuristic scheduling algorithm called the ECG-algorithm is designed by compiling two scheduling guidelines. The performance of the ECG-algorithm is evaluated through worst-case analysis. Letting w(ECG) denote the length of an ECG-schedule and w(opt) the length of an optimal schedule, we established the bound w(ECG)/w(opt) less-than-or-equal-to k + 1 - 2/[max {m(i)}(z + 1)], which is smaller than other known bounds. | en_US |
dc.identifier.doi |
10.1007/BF01990519 | en_US |
dc.identifier.issn |
0006-3835 | en_US |
dc.identifier.journal |
BIT | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1007/BF01990519 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/3191 | |
dc.identifier.wosnumber |
WOS:A1993LZ68700001 | |
dc.language.iso |
en_US | en_US |
dc.subject |
SCHEDULING | en_US |
dc.subject |
PARALLEL PROCESSING | en_US |
dc.subject |
HEURISTIC METHODS | en_US |
dc.subject |
WORST-CASE ANALYSIS | en_US |
dc.title |
MODELING OF SUPERSCALAR INSTRUCTION SCHEDULING AND ANALYSIS OF A HEURISTIC SCHEDULING ALGORITHM | en_US |
dc.type |
Article | en_US |
檔案
- A1993LZ68700001.pdf (901.1 KB, Adobe PDF)
所屬典藏: 期刊論文