{"title":"编译在元胞机器上并行执行的前序程序","authors":"Alexis Koster","doi":"10.1145/800171.809619","DOIUrl":null,"url":null,"abstract":"This paper investigates features of a PROLOG compiler for Mago's cellular machine. The compiler generates parallel FFP (Formal Functional Programming) code. Hence high efficiency in the execution of PROLOG programs can be achieved on this machine, owing to the almost unbounded parallelism it can accommodate.\n Techniques for implementing the parallel evaluation of the clauses of a relation (OR parallelism) are given. Problems in the exploitation of the parallel evaluation of a conjunction of goals (AND parallelism) are discussed. An FFP representation of the run-time environment of PROLOG is given. It is based on a previously published FFP implementation of unification. It allows matching of arguments through unification in linear time and space.","PeriodicalId":218138,"journal":{"name":"ACM '84","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Compiling prolog programs for parallel execution on a cellular machine\",\"authors\":\"Alexis Koster\",\"doi\":\"10.1145/800171.809619\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper investigates features of a PROLOG compiler for Mago's cellular machine. The compiler generates parallel FFP (Formal Functional Programming) code. Hence high efficiency in the execution of PROLOG programs can be achieved on this machine, owing to the almost unbounded parallelism it can accommodate.\\n Techniques for implementing the parallel evaluation of the clauses of a relation (OR parallelism) are given. Problems in the exploitation of the parallel evaluation of a conjunction of goals (AND parallelism) are discussed. An FFP representation of the run-time environment of PROLOG is given. It is based on a previously published FFP implementation of unification. It allows matching of arguments through unification in linear time and space.\",\"PeriodicalId\":218138,\"journal\":{\"name\":\"ACM '84\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM '84\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800171.809619\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM '84","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800171.809619","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Compiling prolog programs for parallel execution on a cellular machine
This paper investigates features of a PROLOG compiler for Mago's cellular machine. The compiler generates parallel FFP (Formal Functional Programming) code. Hence high efficiency in the execution of PROLOG programs can be achieved on this machine, owing to the almost unbounded parallelism it can accommodate.
Techniques for implementing the parallel evaluation of the clauses of a relation (OR parallelism) are given. Problems in the exploitation of the parallel evaluation of a conjunction of goals (AND parallelism) are discussed. An FFP representation of the run-time environment of PROLOG is given. It is based on a previously published FFP implementation of unification. It allows matching of arguments through unification in linear time and space.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
