{"title":"一种改进的WAM模型寄存器分配算法","authors":"Hu Ziang, Xiang Rong Ci","doi":"10.1109/TAI.1990.130415","DOIUrl":null,"url":null,"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.<<ETX>>","PeriodicalId":366276,"journal":{"name":"[1990] Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An improved register allocation algorithm for the WAM model\",\"authors\":\"Hu Ziang, Xiang Rong Ci\",\"doi\":\"10.1109/TAI.1990.130415\",\"DOIUrl\":null,\"url\":null,\"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.<<ETX>>\",\"PeriodicalId\":366276,\"journal\":{\"name\":\"[1990] Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-11-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1990] Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TAI.1990.130415\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1990] Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAI.1990.130415","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An improved register allocation algorithm for the WAM model
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.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
![[1990] Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
扫码关注我们
