COMPARISON OF LINEAR SCAN AND GRAPH COLORING ALGORITHM USED IN DEVELOPMENT OF REGISTER ALLOCATION

Abstract

Register allocation refers a process to assigns variables to
registers as well as in Main memory. Within compiler optimization, register
allocation is the method to assign bulky number of target program variables
against a little number of CPU registers. Thus CUP registers are helpful to
reduce the execution time of programs in CPU. As we know CUP registers
are fast memory chunks but they are limited in numbers. So to get better
performance of an algorithm, runtime compiler must have an efficient
register allocation algorithm. In this paper, Register Allocation algorithms
are compared with respect to the concept of their generated allocations and
the execution style of the algorithms themselves. The assessment is based
on their comparison for compiler optimization basically. The paper discusses
the performance comparison of Graph-coloring allocation with Linear Scan,
register allocation algorithms.