Register Allocation by Evolutionary Algorithm

Graph coloring is a highly effective approach to intraprocedural register allocation. In this paper, we describe a new algorithm for intraprocedural register allocation called HECRA, an algorithm that extends a classic graph coloring register allocator to use a hybrid evolutionary coloring algorithm...

Full description

Saved in:
Bibliographic Details
Main Authors: Negri Lintzmayer, Carla, Mulati, Mauro Henrique, Faustino da Silva, Anderson
Format: Conference Proceeding
Language:English
Subjects:
Ant Colony Optimization
Color
ColorAnt-RT
Equations
Graph Coloring
HCA
Mathematical model
Register Allocation
Registers
Resource management
Sociology
Statistics
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 215
container_issue
container_start_page 207
container_title
container_volume
creator Negri Lintzmayer, Carla
Mulati, Mauro Henrique
Faustino da Silva, Anderson
description Graph coloring is a highly effective approach to intraprocedural register allocation. In this paper, we describe a new algorithm for intraprocedural register allocation called HECRA, an algorithm that extends a classic graph coloring register allocator to use a hybrid evolutionary coloring algorithm. The experiments demonstrated that our algorithm is able to minimize the amount of spills, thereby improving the quality of the generated code. Besides, HECRA is interesting in contexts where compile time is a concern, and not only the quality of the generated code.
doi_str_mv 10.1109/SCCC.2012.31
format conference_proceeding
fullrecord <record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_6694091</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6694091</ieee_id><sourcerecordid>6694091</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-f0c44d668640d29f5b549a6315bf5d20fc263b28eaabe5886525ae400e7916fc3</originalsourceid><addsrcrecordid>eNotjs1Kw0AURkdRMK3u3LnJC0y9987MTe6yhFqFguDPukySmTqSGkmi0Le3oquPw4HDp9Q1wgIR5Pa5qqoFAdLC4ImaoS1ESEwhpyojFtTAhs5Uho5IWwG6ULNxfAcgIMFM6aewS-MUhnzZdX3jp9R_5PUhX3333dcv-OFwVLt-SNPb_lKdR9-N4ep_5-r1bvVS3evN4_qhWm50wsJNOkJjbctcsoWWJLraWfFs0NXRtQSxITY1lcH7OriyZEfOBwsQCkGOjZmrm79uCiFsP4e0P97YMosFQfMD8rtCqQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Register Allocation by Evolutionary Algorithm</title><source>IEEE Xplore All Conference Series</source><creator>Negri Lintzmayer, Carla ; Mulati, Mauro Henrique ; Faustino da Silva, Anderson</creator><creatorcontrib>Negri Lintzmayer, Carla ; Mulati, Mauro Henrique ; Faustino da Silva, Anderson</creatorcontrib><description>Graph coloring is a highly effective approach to intraprocedural register allocation. In this paper, we describe a new algorithm for intraprocedural register allocation called HECRA, an algorithm that extends a classic graph coloring register allocator to use a hybrid evolutionary coloring algorithm. The experiments demonstrated that our algorithm is able to minimize the amount of spills, thereby improving the quality of the generated code. Besides, HECRA is interesting in contexts where compile time is a concern, and not only the quality of the generated code.</description><identifier>ISSN: 1522-4902</identifier><identifier>EISSN: 2691-0632</identifier><identifier>EISBN: 1479929379</identifier><identifier>EISBN: 9781479929382</identifier><identifier>EISBN: 9781479929375</identifier><identifier>EISBN: 1479929387</identifier><identifier>DOI: 10.1109/SCCC.2012.31</identifier><identifier>CODEN: IEEPAD</identifier><language>eng</language><publisher>IEEE</publisher><subject>Ant Colony Optimization ; Color ; ColorAnt-RT ; Equations ; Graph Coloring ; HCA ; Mathematical model ; Register Allocation ; Registers ; Resource management ; Sociology ; Statistics</subject><ispartof>2012 31st International Conference of the Chilean Computer Science Society, 2012, p.207-215</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6694091$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,23930,23931,25140,27925,54555,54932</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6694091$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Negri Lintzmayer, Carla</creatorcontrib><creatorcontrib>Mulati, Mauro Henrique</creatorcontrib><creatorcontrib>Faustino da Silva, Anderson</creatorcontrib><title>Register Allocation by Evolutionary Algorithm</title><title>2012 31st International Conference of the Chilean Computer Science Society</title><addtitle>sccc</addtitle><description>Graph coloring is a highly effective approach to intraprocedural register allocation. In this paper, we describe a new algorithm for intraprocedural register allocation called HECRA, an algorithm that extends a classic graph coloring register allocator to use a hybrid evolutionary coloring algorithm. The experiments demonstrated that our algorithm is able to minimize the amount of spills, thereby improving the quality of the generated code. Besides, HECRA is interesting in contexts where compile time is a concern, and not only the quality of the generated code.</description><subject>Ant Colony Optimization</subject><subject>Color</subject><subject>ColorAnt-RT</subject><subject>Equations</subject><subject>Graph Coloring</subject><subject>HCA</subject><subject>Mathematical model</subject><subject>Register Allocation</subject><subject>Registers</subject><subject>Resource management</subject><subject>Sociology</subject><subject>Statistics</subject><issn>1522-4902</issn><issn>2691-0632</issn><isbn>1479929379</isbn><isbn>9781479929382</isbn><isbn>9781479929375</isbn><isbn>1479929387</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotjs1Kw0AURkdRMK3u3LnJC0y9987MTe6yhFqFguDPukySmTqSGkmi0Le3oquPw4HDp9Q1wgIR5Pa5qqoFAdLC4ImaoS1ESEwhpyojFtTAhs5Uho5IWwG6ULNxfAcgIMFM6aewS-MUhnzZdX3jp9R_5PUhX3333dcv-OFwVLt-SNPb_lKdR9-N4ep_5-r1bvVS3evN4_qhWm50wsJNOkJjbctcsoWWJLraWfFs0NXRtQSxITY1lcH7OriyZEfOBwsQCkGOjZmrm79uCiFsP4e0P97YMosFQfMD8rtCqQ</recordid><startdate>201211</startdate><enddate>201211</enddate><creator>Negri Lintzmayer, Carla</creator><creator>Mulati, Mauro Henrique</creator><creator>Faustino da Silva, Anderson</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201211</creationdate><title>Register Allocation by Evolutionary Algorithm</title><author>Negri Lintzmayer, Carla ; Mulati, Mauro Henrique ; Faustino da Silva, Anderson</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-f0c44d668640d29f5b549a6315bf5d20fc263b28eaabe5886525ae400e7916fc3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Ant Colony Optimization</topic><topic>Color</topic><topic>ColorAnt-RT</topic><topic>Equations</topic><topic>Graph Coloring</topic><topic>HCA</topic><topic>Mathematical model</topic><topic>Register Allocation</topic><topic>Registers</topic><topic>Resource management</topic><topic>Sociology</topic><topic>Statistics</topic><toplevel>online_resources</toplevel><creatorcontrib>Negri Lintzmayer, Carla</creatorcontrib><creatorcontrib>Mulati, Mauro Henrique</creatorcontrib><creatorcontrib>Faustino da Silva, Anderson</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Negri Lintzmayer, Carla</au><au>Mulati, Mauro Henrique</au><au>Faustino da Silva, Anderson</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Register Allocation by Evolutionary Algorithm</atitle><btitle>2012 31st International Conference of the Chilean Computer Science Society</btitle><stitle>sccc</stitle><date>2012-11</date><risdate>2012</risdate><spage>207</spage><epage>215</epage><pages>207-215</pages><issn>1522-4902</issn><eissn>2691-0632</eissn><eisbn>1479929379</eisbn><eisbn>9781479929382</eisbn><eisbn>9781479929375</eisbn><eisbn>1479929387</eisbn><coden>IEEPAD</coden><abstract>Graph coloring is a highly effective approach to intraprocedural register allocation. In this paper, we describe a new algorithm for intraprocedural register allocation called HECRA, an algorithm that extends a classic graph coloring register allocator to use a hybrid evolutionary coloring algorithm. The experiments demonstrated that our algorithm is able to minimize the amount of spills, thereby improving the quality of the generated code. Besides, HECRA is interesting in contexts where compile time is a concern, and not only the quality of the generated code.</abstract><pub>IEEE</pub><doi>10.1109/SCCC.2012.31</doi><tpages>9</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1522-4902
ispartof 2012 31st International Conference of the Chilean Computer Science Society, 2012, p.207-215
issn 1522-4902
2691-0632
language eng
recordid cdi_ieee_primary_6694091
source IEEE Xplore All Conference Series
subjects Ant Colony Optimization
Color
ColorAnt-RT
Equations
Graph Coloring
HCA
Mathematical model
Register Allocation
Registers
Resource management
Sociology
Statistics
title Register Allocation by Evolutionary Algorithm
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T21%3A07%3A10IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Register%20Allocation%20by%20Evolutionary%20Algorithm&rft.btitle=2012%2031st%20International%20Conference%20of%20the%20Chilean%20Computer%20Science%20Society&rft.au=Negri%20Lintzmayer,%20Carla&rft.date=2012-11&rft.spage=207&rft.epage=215&rft.pages=207-215&rft.issn=1522-4902&rft.eissn=2691-0632&rft.coden=IEEPAD&rft_id=info:doi/10.1109/SCCC.2012.31&rft.eisbn=1479929379&rft.eisbn_list=9781479929382&rft.eisbn_list=9781479929375&rft.eisbn_list=1479929387&rft_dat=%3Cieee_CHZPO%3E6694091%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i175t-f0c44d668640d29f5b549a6315bf5d20fc263b28eaabe5886525ae400e7916fc3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6694091&rfr_iscdi=true