一种改进的WAM模型寄存器分配算法

Hu Ziang, Xiang Rong Ci
{"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}
引用次数: 1

摘要

提出了一种改进的自适应统一顺序算法。它用于Warren抽象机(WAM) Prolog实现的寄存器分配。该算法基于将子句划分为块。其目的是为程序生成更好的Prolog代码,以便它们在执行时具有更少的指令和数据移动。通过一种良好的冲突处理算法和自适应复合参数处理顺序的方法来实现。实践证明,该方法是有效的
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信