research-article

Free access

Microcode compaction: looking backward and looking forward

Authors:

Joseph A. Fisher,

David Landskov,

Bruce D. ShriverAuthors Info & Claims

AFIPS '81: Proceedings of the May 4-7, 1981, national computer conference

Pages 95 - 102

https://doi.org/10.1145/1500412.1500426

Published: 04 May 1981 Publication History

Abstract

The past decade has seen significant advances in the state of the art in microcode compaction. Microprograms are compacted by placing several microoperations into each microinstruction, subject to the constraints of data dependency in the program and legal resource usage in the machine on which the microcode will execute. The compaction process attempts to make the code run as fast as possible. In this paper we will not only survey the most recent past in microcode compaction but will also speculate about the near future.

References

[1]

Davidson, S. and B. D. Shriver. "Firmware Engineering: An Extensive Update." In Informatik-Fachberichte, Vol. 31: Firmware Engineering, Springer-Verlag, 1980, pp. 25--71.

[2]

Ramamoorthy, D. V. and M. Tsuchiya. "A High-Level Language for Horizontal Microprogramming." IEEE Trans. Comput. C-23, 8 (Aug. 1974), pp. 791--801.

Digital Library

[3]

Landskov, D., S. Davidson, B. Shriver, and P. W. Mallett. "Local Microcode Compaction Techniques." Comput. Surv. 12, 3 (Sept. 1980), pp. 261--294.

Digital Library

[4]

Fisher, J. A. The Optimization of Horizontal Microcode Within and Beyond Basic Blocks: An Application of Processor Scheduling With Resources. U.S. Dept. of Energy Report, Mathematics and Computing COO-3077-161, New York Univ., Oct. 1979.

[5]

Tokoro, M., T. Takizuka, E. Tamura, and I. Yamaura. "A Technique of Global Optimization of Microprograms." In Proc. 11th Annual Workshop on Microprogramming, ACM, IEEE, New York, 1978, pp. 41--50.

Digital Library

[6]

Fisher, J. A. "Trace Scheduling: A Technique for Global Microcode Compaction." IEEE Trans. Comput., to appear.

Digital Library

[7]

Mallett, P. W. "Methods of Compacting Microprograms." Ph.D. dissertation, Univ. of Southwestern Louisiana, Lafayette, Dec. 1978.

Digital Library

[8]

Davidson, S., D. Landskov, B. D. Shriver, and P. W. Mallett. "Some Experiments in Local Microcode Compaction for Horizontal Machines." IEEE Trans. Comput., to appear.

Digital Library

[9]

Dasgupta, S. "The Organization of Microprogram Stores." Comput. Surv. 11, 1 (March 1979), pp. 39--65.

Digital Library

[10]

Landskov, D. "The Equivalence of FCFS Compaction to List Scheduling With Source Order." Dept. of Computer Science Technical Report, Univ. of Southwestern Louisiana, Lafayette, Jan. 1981.

[11]

Aho, A. V., and J. D. Ullman. Principles of Compiler Design. Addison-Wesley, Reading, Mass., 1977.

Digital Library

[12]

Wood, W. G. "The Computer Aided Design of Microprograms." Ph.D. dissertation, Univ. of Edinburgh, Scotland, 1979.

[13]

Padua, D. A., D. J. Kuck, and D. H. Lawrie. "High-Speed Multiprocessors and Compilation Techniques." IEEE Trans. Comput. C-29, 9 (Sept. 1980), pp. 763--776.

Digital Library

[14]

Davidson, S. and B. D. Shriver. "A Solution to the Resource Binding Problem." In Proc. 1981 AFIPS National Computer Conf. AFIPS Press, Arlington, Va.

[15]

Riseman, E. M. and C. C. Foster. "The Inhibition of Potential Parallelism by Conditional Jumps." IEEE Trans. Comput. C-21, 12 (Dec. 1972), pp. 1405--1411.

Digital Library

Cited By

Aiken ABanerjee UKejariwal ANicolau AAiken ABanerjee UKejariwal ANicolau A(2016)Trace SchedulingInstruction Level Parallelism10.1007/978-1-4899-7797-7_4(79-116)Online publication date: 30-Nov-2016
https://doi.org/10.1007/978-1-4899-7797-7_4
Aiken ABanerjee UKejariwal ANicolau AAiken ABanerjee UKejariwal ANicolau A(2016)Scheduling Basic BlocksInstruction Level Parallelism10.1007/978-1-4899-7797-7_3(43-77)Online publication date: 30-Nov-2016
https://doi.org/10.1007/978-1-4899-7797-7_3
Govindarajan R(2010)Instruction SchedulingThe Compiler Design Handbook10.1201/9781420040579.ch17Online publication date: 7-Mar-2010
https://doi.org/10.1201/9781420040579.ch17
Show More Cited By

Microcode compaction: looking backward and looking forward
1. Software and its engineering
  1. Software notations and tools
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
    2. Online algorithms
      1. Online learning algorithms
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning

Recommendations

Some Experiments in Local Microcode Compaction for Horizontal Machines

Microcode compaction is an essential tool for the compilation of high-level language microprograms into microinstructions with parallel microoperations. The purpose of the research reported in this paper is to compare four microcode compaction methods ...
Issues of the design of a low level microprogramming language for global microcode compaction
MICRO 14: Proceedings of the 14th annual workshop on Microprogramming

Microcode compaction, or packing, is the process of assigning microoperations to microwords so that the minimum number of microwords and execution time is used by the microprogram. The techniques for global microcode compaction have been described ...
Local code generation and compaction in optimizing microcode compilers

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

AFIPS '81: Proceedings of the May 4-7, 1981, national computer conference

May 1981

736 pages

ISBN:9781450379212

DOI:10.1145/1500412

Copyright © 1981 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

AFIPS: American Federation of Information Processing Societies

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 May 1981

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

60
Total Citations
View Citations
215
Total Downloads

Downloads (Last 12 months)61
Downloads (Last 6 weeks)6

Reflects downloads up to 15 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Aiken ABanerjee UKejariwal ANicolau AAiken ABanerjee UKejariwal ANicolau A(2016)Trace SchedulingInstruction Level Parallelism10.1007/978-1-4899-7797-7_4(79-116)Online publication date: 30-Nov-2016
https://doi.org/10.1007/978-1-4899-7797-7_4
Aiken ABanerjee UKejariwal ANicolau AAiken ABanerjee UKejariwal ANicolau A(2016)Scheduling Basic BlocksInstruction Level Parallelism10.1007/978-1-4899-7797-7_3(43-77)Online publication date: 30-Nov-2016
https://doi.org/10.1007/978-1-4899-7797-7_3
Govindarajan R(2010)Instruction SchedulingThe Compiler Design Handbook10.1201/9781420040579.ch17Online publication date: 7-Mar-2010
https://doi.org/10.1201/9781420040579.ch17
Rong HGovindarajan R(2009)Advances in Software PipeliningThe Compiler Design Handbook10.1201/9781420043839.ch20(20-1-20-73)Online publication date: 7-Dec-2009
https://doi.org/10.1201/9781420043839.ch20
Shung CJain RRimey KWang ESrivastava MRichards BLettang EKhalid Azim SThon LHilfinger PRabaey JBrodersen R(2006)An integrated CAD system for algorithm-specific IC designIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/43.7562810:4(447-463)Online publication date: 1-Nov-2006
https://dl.acm.org/doi/10.1109/43.75628
Lam M(2004)Software pipeliningACM SIGPLAN Notices10.1145/989393.98942039:4(244-256)Online publication date: 1-Apr-2004
https://dl.acm.org/doi/10.1145/989393.989420
Bruce KSchuett Avan Gent RFiech A(2003)PolyTOILACM Transactions on Programming Languages and Systems10.1145/641888.64189125:2(225-290)Online publication date: 1-Mar-2003
https://dl.acm.org/doi/10.1145/641888.641891
Ramsey NCifuentes C(2003)A transformational approach to binary translation of delayed branchesACM Transactions on Programming Languages and Systems10.1145/641888.64189025:2(210-224)Online publication date: 1-Mar-2003
https://dl.acm.org/doi/10.1145/641888.641890
Henzinger TQadeer SRajamani STasiran S(2002)An assume-guarantee rule for checking simulationACM Transactions on Programming Languages and Systems10.1145/509705.50970724:1(51-64)Online publication date: 1-Jan-2002
https://dl.acm.org/doi/10.1145/509705.509707
Lee PKedem Z(2002)Automatic data and computation decomposition on distributed memory parallel computersACM Transactions on Programming Languages and Systems10.1145/509705.50970624:1(1-50)Online publication date: 1-Jan-2002
https://dl.acm.org/doi/10.1145/509705.509706
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents