Our system is currently under heavy load due to increased usage. We're actively working on upgrades to improve performance. Thank you for your patience.
22nd Digital Avionics Systems Conference. Proceedings (Cat. No.03CH37449)
DOI: 10.1109/micro.2003.1253206
|View full text |Cite
|
Sign up to set email alerts
|

Instruction replication for clustered microarchitectures

Abstract: This work presents a new compilation technique that uses instruction replication in order to

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 12 publications
(12 citation statements)
references
References 18 publications
0
12
0
Order By: Relevance
“…By taking several decisions a final schedule and assignment is obtained. In our approach, a decision may be one of the following actions: (1) establish a distance relation between two instructions in the final schedule (the final schedule is found when all instructions are assigned to a particular cycle and to a physical cluster), (2) schedule an instruction in a particular cycle, (3) assign a set of instructions to the same physical cluster, or (4) assign two sets of instructions to different physical clusters.…”
Section: Novel Cluster Scheduling Mechanismsmentioning
confidence: 99%
See 2 more Smart Citations
“…By taking several decisions a final schedule and assignment is obtained. In our approach, a decision may be one of the following actions: (1) establish a distance relation between two instructions in the final schedule (the final schedule is found when all instructions are assigned to a particular cycle and to a physical cluster), (2) schedule an instruction in a particular cycle, (3) assign a set of instructions to the same physical cluster, or (4) assign two sets of instructions to different physical clusters.…”
Section: Novel Cluster Scheduling Mechanismsmentioning
confidence: 99%
“…Assuming a target processor with four clusters, the mapping process works as follows: (1) After fusing a pair of VCs, a new VC is created that contains all nodes of the original VCs, and an edge to any VC previously linked to the VCs fused. In the previous example, VC' 2 obtained from the fusion of VC 2 and VC 3 inherits all instructions previously mapped to them, and all edges from VCs linked to VC 2 or VC 3 .…”
Section: Virtual Cluster Graphmentioning
confidence: 99%
See 1 more Smart Citation
“…The only drawback of such an architecture is the intercluster communication cost. Various groups [2,3,4,6,9,10] have studied cluster assignment mechanisms for one thread to reduce the overhead of inter-cluster communication. We extend their ideas to a clustered architecture with multiple threads.…”
Section: Related Workmentioning
confidence: 99%
“…The information considered is obtained through an estimate of the final schedule, which is called a pseudoschedule [3]. Our approach also features novel instruction replication heuristics to further reduce the number of communications [4], [5].…”
Section: Introductionmentioning
confidence: 99%