Candidate Best Optimizations Sequences for Code Size Reduction

Recently, the number of smaller and smarter embedded devices have rapidly increased.This increment puts more pressure on the compiler developer to develop more dedicated application programs for these devices.Modern compilers (like LLVM) offer standard optimization levels (flags) that deal with reducing the code size named Os and FOz flags.The question arise in this paper in is: Is it possible to find sequence that deliver smaller code compare to standard flags?A Sign Table, it is the suggested method that is introduced in this paper.It can suggest an optimization sequence that can reduce the code size for set of unseen program.Initially, two thousand optimization sequences are generated randomly.Each sequence is compiled with 50 programs, where the programs that give smaller code size compared with the Os or Oz flags are extracted.After building the signs table, which contains the sequences that give the average programs sizes smaller than the Os or Oz flags, the process of quantifying similarity between the unseen program and the programs contained within the signs table is performed.The sequences that belong to the most similar programs are selected to compile the unseen program.The proposed methodology is assessed through an empirical investigation, employing three benchmark suites, namely PolyBench, Shootout, and Stanford.The experiments show that the proposed method reduces the unseen program size by about 9% compared standsrd optimization flags.