The polyhedral model is considered as a strong and powerful platform for efficient and optimizing programs. The polyhedral model is totally based on the algebraic representation of a program and consider as production and mature compilers. This compiler is a valid and good way to express the loop structure applied in run time compilation and it can be suitable for loop-based programs. To enhance the algebraic progression and resolving complexities, we are proposing two solutions that can enhance the speeding and memory efficiency during the compilation process which includes hash mapping and parallel systems. Moreover, we are comparing the different applications of the polyhedral compilers and detecting the lacking in performance which includes TIRAMISU and Alpha Z.