scientific article; zbMATH DE number 1693495

zbMATH Open0977.68833MaRDI QIDQ2764075FDOQ2764075

Authors: David Gregg 

Publication date: 22 January 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2027/20270200

Title of this publication is not available (Why is that?)

Recommendations

• Adoptability and effectiveness of microcode compaction algorithms in superscalar processing
• List scheduling in the presence of branches. A theoretical evaluation
• CLP approach to optimal instruction scheduling for VLIW processors
• Data-dependency graph transformations for instruction scheduling
• scientific article; zbMATH DE number 1975592

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of compilers and interpreters (68N20)

Cited In (2)

• TST - an algorithm for global microcode compaction with timing constraints
• Adoptability and effectiveness of microcode compaction algorithms in superscalar processing

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 Q2764075)