Register Allocation with Graph Coloring by Ant Colony Optimization

The goal of register allocation is to allocate an unbounded number of program values to a finite number of machine registers. In this paper, we describe a new algorithm for intraprocedural register allocation called CA-RT-RA, an algorithm that extends a classic graph coloring register allocator to u...

Full description

Saved in:
Bibliographic Details
Published in2011 30th International Conference of the Chilean Computer Science Society pp. 247 - 255
Main Authors Lintzmayer, C. N., Mulati, M. H., da Silva, A. F.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.11.2011
Subjects
Ant Colony Optimization
Color
ColorAnt-RT
Equations
Graph Coloring
Heuristic algorithms
Interference
Mathematical model
Register Allocation
Registers
Resource management
Online AccessGet full text
ISBN9781467313643
1467313645
ISSN1522-4902
DOI10.1109/SCCC.2011.32

Cover

Abstract The goal of register allocation is to allocate an unbounded number of program values to a finite number of machine registers. In this paper, we describe a new algorithm for intraprocedural register allocation called CA-RT-RA, an algorithm that extends a classic graph coloring register allocator to use our graph coloring algorithm Color Ant-RT. The experiments demonstrated that our algorithm is able to minimize the amount of spills, thereby improving the quality of the generated code. CA-RT-RA is interesting in applications where compile time is not a concern, but the code quality.
AbstractList The goal of register allocation is to allocate an unbounded number of program values to a finite number of machine registers. In this paper, we describe a new algorithm for intraprocedural register allocation called CA-RT-RA, an algorithm that extends a classic graph coloring register allocator to use our graph coloring algorithm Color Ant-RT. The experiments demonstrated that our algorithm is able to minimize the amount of spills, thereby improving the quality of the generated code. CA-RT-RA is interesting in applications where compile time is not a concern, but the code quality.
Author da Silva, A. F.
Mulati, M. H.
Lintzmayer, C. N.
Author_xml – sequence: 1
  givenname: C. N.
  surname: Lintzmayer
  fullname: Lintzmayer, C. N.
  email: carla0negri@gmail.com
  organization: State Univ. of Maringa, Maringa, Brazil
– sequence: 2
  givenname: M. H.
  surname: Mulati
  fullname: Mulati, M. H.
  email: mhmulati@gmail.com
  organization: State Univ. of Maringa, Maringa, Brazil
– sequence: 3
  givenname: A. F.
  surname: da Silva
  fullname: da Silva, A. F.
  email: anderson@din.uem.br
  organization: State Univ. of Maringa, Maringa, Brazil
BookMark eNotj89LwzAcxSNOcJu7efOSf6A1ybdJmmMtbgqDgT_OI02TLdKlpQ1I_est1dN7n8fjwVuhRWiDReiekpRSoh7fy7JMGaE0BXaFNkrmRArFM5ErcT0zzYQECiKDBVpSzliSKcJu0WoYvghhhCm6RE9v9uSHaHtcNE1rdPRtwN8-nvGu190Zl23T9j6ccDXiIsSZw4gPXfQX_zPX79CN081gN_-6Rp_b54_yJdkfdq9lsU88lTwmhoOVnEBuZF1JpyTVjBjroFb1FEHOiOaT1VJS45yzjk-XKudA1iZXHNbo4W_XW2uPXe8vuh-PAgRkJINfendOlA
CODEN IEEPAD
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/SCCC.2011.32
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Xplore Digital Library (LUT)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9780769546896
0769546897
EndPage 255
ExternalDocumentID 6363404
Genre orig-research
GroupedDBID 23M
29O
29R
6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ABLEC
ACGFS
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IPLJI
M43
OCL
RIE
RIL
RNS
ID FETCH-LOGICAL-i175t-c53e75038c7db7f971a20cef3d9dc7d3820a59dca771cfffef5807bff37dc8953
IEDL.DBID RIE
ISBN 9781467313643
1467313645
ISSN 1522-4902
IngestDate Wed Aug 27 03:29:28 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-c53e75038c7db7f971a20cef3d9dc7d3820a59dca771cfffef5807bff37dc8953
PageCount 9
ParticipantIDs ieee_primary_6363404
PublicationCentury 2000
PublicationDate 2011-Nov.
PublicationDateYYYYMMDD 2011-11-01
PublicationDate_xml – month: 11
  year: 2011
  text: 2011-Nov.
PublicationDecade 2010
PublicationTitle 2011 30th International Conference of the Chilean Computer Science Society
PublicationTitleAbbrev sccc
PublicationYear 2011
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0020291
ssj0001035037
Score 1.815319
Snippet The goal of register allocation is to allocate an unbounded number of program values to a finite number of machine registers. In this paper, we describe a new...
SourceID ieee
SourceType Publisher
StartPage 247
SubjectTerms Ant Colony Optimization
Color
ColorAnt-RT
Equations
Graph Coloring
Heuristic algorithms
Interference
Mathematical model
Register Allocation
Registers
Resource management
Title Register Allocation with Graph Coloring by Ant Colony Optimization
URI https://ieeexplore.ieee.org/document/6363404
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV07T8MwELZKJ6YCLeItD4ykTew4dsYSUSokHgIqdati5ywhIEUoHcqvx-ekLUIMbPZNjmP7nt93hJxbZVUsGATucWRBLAoIchkq5_PE7sgIbULrC2TvkvEkvpmKaYtcrLEwAOCLz6CPQ5_LL-ZmgaGyQcITHiP555ZUSY3V2sRTMEX2w9kKWVpzpeIS0pB5UFcieYR5txXXUzPn64r4dPCUZVnN7IkdSX50XPEKZ9Qht6ul1nUmr_1Fpfvm6xeL43-_ZYf0NtA--rBWWrukBeUe6ax6O9DmqnfJ5SMgNMiJhm-o7_D_UQza0mukuKbZvC7do3pJh2Xl5-WS3rsX6L2BdvbIZHT1nI2Dpt9C8OKMiCowggOmNZWRhZY2lVHOQgOWF2nhRNwZC7lww1zKyFhrwQoVSm0tl4VRqeD7pF3OSzggVCpIkcknNrlzQDnLDcsZA614VOgkDg9JF7dk9lFTasya3Tj6W3xMtn0o10MAT0i7-lzAqbMFKn3mD8E3-tOsGw
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV05T8MwFLaqMsBUoEXceGAkbeIjdsYSUQq0BUErdatix5YQkCCUDuXXYzvpIcTAZr_JcWy_8_seAJeaa04oUp55HJFHaKq8hPnc-DzEHBkqpK9dgewo7E_I_ZROa-BqhYVRSrniM9W2Q5fLT3M5t6GyTohDTCz55xYlhNASrbWOqNgk2Ya75aOoZEu1i4h85GBdIcOBzbwt2Z6qOV7VxEedlziOS25P25Nko-eKUzm9BhguF1tWmry154Voy-9fPI7__Zpd0FqD--DTSm3tgZrK9kFj2d0BVpe9Ca6flQUHGVH33Wo8-wehDdvCW0tyDeO8LN6DYgG7WeHm2QI-mjfoowJ3tsCkdzOO-17VccF7NWZE4UmKlU1scslSwXTEggT5UmmcRqkRYWMuJNQME8YCqbVWmnKfCa0xSyWPKD4A9SzP1CGAjKvIcvkQmRgXFKNEogQhJTgOUhES_wg07ZbMPktSjVm1G8d_iy_Adn88HMwGd6OHE7DjArsOEHgK6sXXXJ0Zy6AQ5-5A_AA1a69o
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2011+30th+International+Conference+of+the+Chilean+Computer+Science+Society&rft.atitle=Register+Allocation+with+Graph+Coloring+by+Ant+Colony+Optimization&rft.au=Lintzmayer%2C+C.+N.&rft.au=Mulati%2C+M.+H.&rft.au=da+Silva%2C+A.+F.&rft.date=2011-11-01&rft.pub=IEEE&rft.isbn=9781467313643&rft.issn=1522-4902&rft.spage=247&rft.epage=255&rft_id=info:doi/10.1109%2FSCCC.2011.32&rft.externalDocID=6363404
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1522-4902&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1522-4902&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1522-4902&client=summon