• DocumentCode
    3708629
  • Title

    A Heuristic Algorithm for Deriving Compact Models of Processor Instruction Sets

  • Author

    Alessandro de Gennaro;Paulius Stankaitis;Andrey Mokhov

  • Author_Institution
    Sch. of Electr. &
  • fYear
    2015
  • fDate
    6/1/2015 12:00:00 AM
  • Firstpage
    100
  • Lastpage
    109
  • Abstract
    Finding a compact formal representation of a processor instruction set is important for easier comprehension by the designer, as well as for synthesis of an efficient hardware implementation of the processor´s microcontroller. We present a new heuristic algorithm for deriving compact models of processor instruction sets. The algorithm is based on finding similarities between pairs of instructions and assigning similar opcodes (using a Hamming distance metric) to similar instructions (using a newly introduced instruction similarity metric). We demonstrate that this heuristic produces results with an average overhead, in terms of area, of 7.8% in comparison to the global optimum on the benchmarks we studied (subsets of instructions of ARM Cortex M0+, Texas Instruments MSP430 and Intel 8051 processors).The algorithm is implemented as an open-source plugin for the Workcraft framework and is validated on a case study of a subset of 61 (out of 68) instructions of ARM Cortex M0+ processor. We compare the presented algorithm against a number of other available implementations.
  • Keywords
    "Encoding","Algorithm design and analysis","Hamming distance","Heuristic algorithms","Instruction sets","Electronic mail","Measurement"
  • Publisher
    ieee
  • Conference_Titel
    Application of Concurrency to System Design (ACSD), 2015 15th International Conference on
  • Electronic_ISBN
    1550-4808
  • Type

    conf

  • DOI
    10.1109/ACSD.2015.17
  • Filename
    7352430