Proceedings. 31st Annual ACM/IEEE International Symposium on Microarchitecture
DOI: 10.1109/micro.1998.742792
|View full text |Cite
|
Sign up to set email alerts
|

Unified assign and schedule: a new approach to scheduling for clustered register file microarchitectures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
146
0

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 102 publications
(148 citation statements)
references
References 13 publications
1
146
0
Order By: Relevance
“…The algorithm initially performs partial scheduling of all frequency configurations for "STEP" instructions (Alg.1 lines 11,[14][15][16][17][18][19][20]. This determines the best configuration and stores it into "BFC".…”
Section: The Drivermentioning
confidence: 99%
See 2 more Smart Citations
“…The algorithm initially performs partial scheduling of all frequency configurations for "STEP" instructions (Alg.1 lines 11,[14][15][16][17][18][19][20]. This determines the best configuration and stores it into "BFC".…”
Section: The Drivermentioning
confidence: 99%
“…This could speed up the UCIFF scheduler, to reach speeds close to those of the Oracle. It is a unified cluster assignment and scheduling algorithm which shares some similarities with UAS [14] but has several unique attributes: i. It operates on a heterogeneous architecture where clusters operate at different frequencies (as described in Section 3.1).…”
Section: The Drivermentioning
confidence: 99%
See 1 more Smart Citation
“…Ellis [21] proposed a popular method, BUG (Bottom-Up Greedy), to partition operations on a trace with scheduling in a two-phases sequence. Ozer et al [22] proposed an algorithm, unified-assign-and-schedule (UAS), to combine cluster assignment and instruction scheduling together into a single phase. Nystrom and Eichenberger [23] presented an algorithm for modulo scheduling to perform partitioning with heuristics in a pre-modulo scheduling pass to allow modulo scheduling to be effective.…”
Section: Related Workmentioning
confidence: 99%
“…While several works exist in the literature on clustered VLIW processors with a unified L1 data cache ( [18] [19][22] [14] among others), few works exist that deal with the wire delay problem at the memory hierarchy. Among them, the Raw machine [24] has an architectural configuration different to the traditional VLIW clustered core presented in this paper.…”
Section: Related Workmentioning
confidence: 99%