遗传算法与指令调度

MICRO 24 Pub Date : 1991-09-01 DOI:10.1145/123465.123507

S. Beaty

{"title":"遗传算法与指令调度","authors":"S. Beaty","doi":"10.1145/123465.123507","DOIUrl":null,"url":null,"abstract":"Many difficulties are encountered when developing an instruction scheduler to produce efficacious code for multiple architectures. Heuristic-based methods were found to produce disappointing results; indeed the goals of validity and length compete. This lead to the introduction of another method to search the solution space of valid schedules: genetic algorithms. Their application to this domain proved fruitful.","PeriodicalId":118572,"journal":{"name":"MICRO 24","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"41","resultStr":"{\"title\":\"Genetic algorithms and instruction scheduling\",\"authors\":\"S. Beaty\",\"doi\":\"10.1145/123465.123507\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many difficulties are encountered when developing an instruction scheduler to produce efficacious code for multiple architectures. Heuristic-based methods were found to produce disappointing results; indeed the goals of validity and length compete. This lead to the introduction of another method to search the solution space of valid schedules: genetic algorithms. Their application to this domain proved fruitful.\",\"PeriodicalId\":118572,\"journal\":{\"name\":\"MICRO 24\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"41\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"MICRO 24\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/123465.123507\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"MICRO 24","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/123465.123507","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 41

摘要

在开发指令调度器以生成适用于多种体系结构的有效代码时，会遇到许多困难。启发式方法被发现产生令人失望的结果;事实上，有效性和长度的目标是相互竞争的。这导致引入另一种方法来搜索有效调度的解空间:遗传算法。他们在这一领域的应用证明是卓有成效的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Genetic algorithms and instruction scheduling

Many difficulties are encountered when developing an instruction scheduler to produce efficacious code for multiple architectures. Heuristic-based methods were found to produce disappointing results; indeed the goals of validity and length compete. This lead to the introduction of another method to search the solution space of valid schedules: genetic algorithms. Their application to this domain proved fruitful.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

MICRO 24

自引率

0.00%

发文量