Microcode compaction with timing constraints

Authors:
Bogong Su;Shiyuan Ding;Jian Wang;Jinshi Xia
Affiliations:
Department of Computer Science and Technology, Tsing Hua University, Beijing, China and Firmware Engineering and Micro-Architecture Design Lab of Colorado State University;Department of Computer Science and Technology, Tsing Hua University, Beijing, China;Department of Computer Science and Technology, Tsing Hua University, Beijing, China;Department of Computer Science and Technology, Tsing Hua University, Beijing, China
Venue:
MICRO 20 Proceedings of the 20th annual workshop on Microprogramming
Year:
1987

Citing 11
Cited 10

URPR—An extension of URCR for software pipelining

MICRO 19 Proceedings of the 19th annual workshop on Microprogramming
An approach to phase-coupled resource allocation and code reorganization for a class of pipeline architectures

An approach to phase-coupled resource allocation and code reorganization for a class of pipeline architectures
Local Microcode Compaction Techniques

ACM Computing Surveys (CSUR)
A formal approach to the problems of microcode compaction caused by transient data resources of the microarchitectures

ACM SIGMICRO Newsletter
Optimizing delayed branches

MICRO 15 Proceedings of the 15th annual workshop on Microprogramming
Microcode compaction via microblock definition

MICRO 15 Proceedings of the 15th annual workshop on Microprogramming
Issues of the design of a low level microprogramming language for global microcode compaction

MICRO 14 Proceedings of the 14th annual workshop on Microprogramming
An approach to microprogram optimization considering resource occupancy and instruction formats

MICRO 10 Proceedings of the 10th annual workshop on Microprogramming
An improvement of trace scheduling for global microcode compaction

MICRO 17 Proceedings of the 17th annual workshop on Microprogramming
Local code generation and compaction in optimizing microcode compilers

Local code generation and compaction in optimizing microcode compilers
A critical analysis of the global optimization problem for horizontal microcode (phase-coupled, compaction, code motion, compilation)

A critical analysis of the global optimization problem for horizontal microcode (phase-coupled, compaction, code motion, compilation)

GURPR - a method for Global Software pipelining

ACM SIGMICRO Newsletter
Global microcode compaction under timing constraints

MICRO 21 Proceedings of the 21st annual workshop on Microprogramming and microarchitecture
Peephole optimization as a targeting and coupling tool

MICRO 22 Proceedings of the 22nd annual workshop on Microprogramming and microarchitecture
Incremental foresighted local compaction

MICRO 22 Proceedings of the 22nd annual workshop on Microprogramming and microarchitecture
Genetic algorithms and instruction scheduling

MICRO 24 Proceedings of the 24th annual international symposium on Microarchitecture
Lookahead scheduling

MICRO 25 Proceedings of the 25th annual international symposium on Microarchitecture
Foresighted Instruction Scheduling Under Timing Constraints

IEEE Transactions on Computers
Software pipelining: a comparison and improvement

MICRO 23 Proceedings of the 23rd annual workshop and symposium on Microprogramming and microarchitecture
GURPR—a method for global software pipelining

MICRO 20 Proceedings of the 20th annual workshop on Microprogramming
Scheduling time-constrained instructions on pipelined processors

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	0.01

Visualization

Abstract

At present, microcode compaction with timing constraints (abbreviated as MCTC) is still an open problem. Complex timing relation between microoperations greatly affects the optimization result of microcode. This paper begins with a survey of MCTC problems, then presents a formal description of MCTC and, on the basis of a systematic study of the characteristics of MCTC, presents a generally-oriented heuristic algorithm— CAS, which has a high success rate of scheduling and promises good optimization result. Preliminary experiments indicate that CAS is better than other existing MCTC algorithms.