article · 2008

Abstract Global Stack Allocation – Register Allocation for Stack Machines

Mark Shannon

Cited by 0Abstract and details only

Abstract

Register allocation is a critical part of any compiler, yet register allocation for stack machines has received relatively little attention in the past. We present a framework for the analysis of register allocation methods for stack machines which has allowed us to analyse current methods. We have used this framework to design the first truly procedure-wide register allocation methods for stack machines. We have designed two such methods, both of which outperform current techniques. This work was funded by the AMADEUS project, part of the DTI’s Next Wave Technologies and Markets Program, in collaboration with MPE Ltd.

Cite this paper

APA 7

Shannon, M. (2008). Abstract Global Stack Allocation – Register Allocation for Stack Machines.

MLA 9

Shannon, Mark. “Abstract Global Stack Allocation – Register Allocation for Stack Machines.” 2008.

Chicago

Shannon, Mark. 2008. “Abstract Global Stack Allocation – Register Allocation for Stack Machines.”

Harvard

Shannon, M. (2008) ‘Abstract Global Stack Allocation – Register Allocation for Stack Machines’.

BibTeX

@article{shannon2008abstract,
  title = {{Abstract Global Stack Allocation – Register Allocation for Stack Machines}},
  author = {Shannon, Mark},
  year = {2008}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.