COMPARISON OF GRAPH COLORING APPROACHES USED IN DEVELOPMENT OF REGISTER ALLOCATION ALGORITHMS

  • Ms. Anju Dave, Dr. Deepika Pathak

Abstract

Graph coloring is one of the finest recognized, trendy and
broadly used study topic in the field of graph theory, having numerous
applications and assumptions, which are continuously revised by various
computer scientists all along the world. This paper discuss the importance,
related conjectures, limitations and performance comparison of different
Graph-coloring allocation methods of Graph theory .The integrated
approaches for graph coloring have been probable region of research for
code generation and compiler optimization. In this paper we have compared
with respect to the basic concept of different graph coloring register
allocations, their style of implementation and quality of execution for
compiler optimization.

Published
2019-12-30
Section
Articles