Optimization of a data dependence graph for the local microcode compaction problem. II: Algorithms and experimental verification

DOI10.1023/B:PACS.0000029577.62131.C2zbMATH Open1105.68338MaRDI QIDQ557500FDOQ557500

Authors: O. N. Malykh, Yu. S. Shakhnovskij 

Publication date: 30 June 2005

Published in: Programming and Computer Software (Search for Journal in Brave)

Recommendations

• Optimization of a data dependence graph for the local microcode compaction problem. I: Problem statement
• Algorithms and Computation
• Localized and compact data-structure for comparability graphs
• Code reorganization using the data dependence graph for vector-pipeline computers
• Worst-case analysis of heuristics for the local microcode optimization problem
• The program dependence graph and its use in optimization
• scientific article; zbMATH DE number 3876561

zbMATH Keywords

exchange permutability problem

Mathematics Subject Classification ID

Data structures (68P05) Nonnumerical algorithms (68W05)

Cited In (5)

• Optimization of a data dependence graph for the local microcode compaction problem. I: Problem statement
• Code reorganization using the data dependence graph for vector-pipeline computers
• TST - an algorithm for global microcode compaction with timing constraints
• Optimization of CMCU with code sharing
• Title not available (Why is that?)

This page was built for publication: Optimization of a data dependence graph for the local microcode compaction problem. II: Algorithms and experimental verification

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