|
 ABSTRACT
A method of sequential microcode compaction for architectures containing transient data resources is discussed.A theoretical apparatus, allowing the identification of microoperation groups requiring synchronization according to their transient data resources as well as their correcposnding transient data resources is suggested.An algorithm, separating the microoperation groups resulting from the transient data resources in the microarchitectures is also discussed.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
Tsuchiya M., Conzales M., "Toward optimization of horizontal microprograms", IEEE Trans. on Comp., Vol. C-25, 1976, 10.
|
| |
3
|
Tokoro M., Tamura E., "Optimization of microprograms", IEEE Trans. on Comp., Vol. C-30, 1981, 7.
|
| |
4
|
Mezzalama M., Prinetto P., "Microinstruction modeling using timing and semantic constraints", Simulation, Modeling and Developemnt", Cairo, 1981.
|
| |
5
|
Landskov D., Davidson S., "Some experiments in local microcode compaction for horizontal machines", IEEE Trans. on Comp., Vol. C-30, 1981, 7.
|
| |
6
|
Boyanov K., Petkov A., Manasiev L., "Microprogramming of bit-slice microsystems", Internal report of Institute of Mathematics, BAS.
|
CITED BY 2
|
|
Bogong Su , Shiyuan Ding , Jian Wang , Jinshi Xia, Microcode compaction with timing constraints, Proceedings of the 20th annual workshop on Microprogramming, p.59-68, December 01-04, 1987, Colorado Springs, Colorado, United States
|
|
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf