Optimization of a data dependence graph for the local microcode compaction problem. I: Problem statement

DOI10.1023/B:PACS.0000013439.23101.14zbMATH Open1101.68492OpenAlexW2017630234MaRDI QIDQ557539FDOQ557539

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

Publication date: 30 June 2005

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

Full work available at URL: https://doi.org/10.1023/b:pacs.0000013439.23101.14

Recommendations

• Optimization of a data dependence graph for the local microcode compaction problem. II: Algorithms and experimental verification
• scientific article; zbMATH DE number 3874571
• Code reorganization using the data dependence graph for vector-pipeline computers
• scientific article; zbMATH DE number 3876561
• Worst-case analysis of heuristics for the local microcode optimization problem

zbMATH Keywords

optimization combinatorial problem

Mathematics Subject Classification ID

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

Cited In (2)

• Optimization of a data dependence graph for the local microcode compaction problem. II: Algorithms and experimental verification
• Title not available (Why is that?)

This page was built for publication: Optimization of a data dependence graph for the local microcode compaction problem. I: Problem statement

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