CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

An Optimal Code Heuristic Approach for Compiler Optimization using Graph Coloring Technique

by Prateek Saraf, Rajnish Dashora
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 79 - Number 1
Year of Publication: 2013
Authors: Prateek Saraf, Rajnish Dashora
10.5120/13708-1461

Prateek Saraf, Rajnish Dashora . An Optimal Code Heuristic Approach for Compiler Optimization using Graph Coloring Technique. International Journal of Computer Applications. 79, 1 ( October 2013), 37-40. DOI=10.5120/13708-1461

@article{ 10.5120/13708-1461,
author = { Prateek Saraf, Rajnish Dashora },
title = { An Optimal Code Heuristic Approach for Compiler Optimization using Graph Coloring Technique },
journal = { International Journal of Computer Applications },
issue_date = { October 2013 },
volume = { 79 },
number = { 1 },
month = { October },
year = { 2013 },
issn = { 0975-8887 },
pages = { 37-40 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume79/number1/13708-1461/ },
doi = { 10.5120/13708-1461 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:51:55.177748+05:30
%A Prateek Saraf
%A Rajnish Dashora
%T An Optimal Code Heuristic Approach for Compiler Optimization using Graph Coloring Technique
%J International Journal of Computer Applications
%@ 0975-8887
%V 79
%N 1
%P 37-40
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Graph theory has found its applications in various fields of computation involved in day to day life. A problem solving approach that incorporates graph theory has an added advantage of being simple and visually more comprehensible [9]. Data mining, image processing, astrology and astronomy, theoretical computer science, artificial intelligence and compiler optimization et al. , every evolving field utilizes efficient algorithms involving graphs and their properties. Graph coloring has major applications in the field of compiler optimization. This paper proposes a heuristic approach of graph coloring for code optimization and hence, improvement in compiler performance and accuracy. Color-based merging of colored graphs reduces the use of temporary variables, increasing efficiency in memory utilization. A comparative analysis has been carried out in order to present the advantages of the proposed algorithm [5] [6].

References
  1. Zhanju Cai, Alei Liang, Zhengwei Qi, Lingyan Jiang, Xiaolong Li, Haibing Guan, Ying Chen, Performance Comparison of Register Allocation Algorithms in Dynamic Binary Translation, International Conference on Knowledge and Systems Engineering, 2009.
  2. Ulrich Hirnschrott, Andreas Krall, and Bernhard Scholz, Graph Coloring vs. Optimal Register Allocation for Optimizing Compilers, Springer-Verlag Berlin Heidelberg ,2003.
  3. Istv´an Juhos, Jano I. van Hemert, Increasing the efficiency of graph coloring algorithms with a representation based on vector operations, Journal of Software, Vol1, No. 2, August, 2006.
  4. Ben A. Abderazek, Arquimedes Canedo and Masahiro Sowa, Quantitative Evaluation of Common Sub expression Elimination on Queue Machines, IEEE, 2008.
  5. Anjali Mahajan, M S Ali, Hybrid Evolutionary Algorithm for Graph Coloring Register Allocation, IEEE, 2008.
  6. David Karger, Rajeev Motwani, Madhu Sudan, Approximate Graph Coloring by Semidefinite Programming, IEEE, 1994.
  7. Monica S. Lam, Alfred V. Aho, Ravi Sethi, Jeffrey D. Ulman, Compilers: Principles, Techniques and Tools 2 Edition, Pearson 2008.
  8. Tommy R. Jensen, Graph Coloring Problems, John Wiley & Sons 1994.
  9. Narsingh Deo. Graph Theory with Applications to Engineering and Computer Science New Edition, PHI Learning 2009.
  10. Thomas H. Cormen, Charles E. Leiserson, Ronald L Rivest, Clifford Stein, Introduction To Algorithms, Mit Press (ma) 2009.
  11. Ashay Dharwadker, The Vertex Coloring Algorithm, Createspace 2011.
Index Terms

Computer Science
Information Sciences

Keywords

Compiler optimization reduced graph coloring Compiler optimization Graph coloring Graph traversal

Powered by PhDFocusTM