scientific article; zbMATH DE number 3874571

MaRDI QIDQ3340110zbMATH OpenFDO

Authors Arndt Bode

Publication date 1984

zbMATH Keywords

compactiondata-dependencemaximal compatibility classmicroinstruction encodingmicrooperation bundlemicroprogrammicroprogramming high-level languagemicroword length reductionNP-completenessresource- conflicttrace-scheduling

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01) Theory of software (68N99)

Recommendations

• Optimization of a data dependence graph for the local microcode compaction problem. II: Algorithms and experimental verification
• Optimization of a data dependence graph for the local microcode compaction problem. I: Problem statement
• scientific article; zbMATH DE number 3878332
• scientific article; zbMATH DE number 3852398
• scientific article; zbMATH DE number 3965405

Cited in

(8)

• Optimization of CMCU with code sharing
• Using graph models in retargetable optimizing compilers for microprocessors with VLIW architectures
• scientific article; zbMATH DE number 3852398 (Why is no real title available?)
• The Complexity of Horizontal Word Encoding in Microprogrammed Machines
• scientific article; zbMATH DE number 194647 (Why is no real title available?)
• scientific article; zbMATH DE number 220159 (Why is no real title available?)
• scientific article; zbMATH DE number 3253166 (Why is no real title available?)
• Optimization of a data dependence graph for the local microcode compaction problem. I: Problem statement

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3340110)