DocumentCode
3057981
Title
An improved register allocation algorithm for the WAM model
Author
Ziang, Hu ; Ci, Xiang Rong
Author_Institution
Dept. of Comput. Sci., Changsha Inst. of Tech., Hunan, China
fYear
1990
fDate
6-9 Nov 1990
Firstpage
651
Lastpage
657
Abstract
An improved adaptable unification order algorithm is presented. It is used in register allocation for a Warren abstract machine (WAM) Prolog implementation. The algorithm is based on the division of a clause into chunks. The purpose is to generate better Prolog codes for programs so that they have fewer instructions and data movements in execution. It is realized by a good conflict handling algorithm and by an adaptable processing order method of compound arguments. The method has been proved to be efficient in practice
Keywords
PROLOG; program compilers; scheduling; Prolog program codes; WAM model; Warren abstract machine; adaptable processing order; adaptable unification order algorithm; chunks; clause division; compound arguments; conflict handling algorithm; register allocation algorithm; Algorithm design and analysis; Computer science; Registers; USA Councils;
fLanguage
English
Publisher
ieee
Conference_Titel
Tools for Artificial Intelligence, 1990.,Proceedings of the 2nd International IEEE Conference on
Conference_Location
Herndon, VA
Print_ISBN
0-8186-2084-6
Type
conf
DOI
10.1109/TAI.1990.130415
Filename
130415
Link To Document