分布式系统中文件和任务放置的遗传算法

Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence Pub Date : 1994-06-27 DOI:10.1109/ICEC.1994.349928

A. Corcoran, D. Schoenefeld

{"title":"分布式系统中文件和任务放置的遗传算法","authors":"A. Corcoran, D. Schoenefeld","doi":"10.1109/ICEC.1994.349928","DOIUrl":null,"url":null,"abstract":"We explore the distributed file and task placement problem, which is intractable. We also discuss genetic algorithms and how they have been used successfully to solve combinatorial problems. Our experimental results show the GA to be far superior to the greedy heuristic in obtaining optimal and near optimal file and task placements for the problem with various data sets.<<ETX>>","PeriodicalId":393865,"journal":{"name":"Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A genetic algorithm for file and task placement in a distributed system\",\"authors\":\"A. Corcoran, D. Schoenefeld\",\"doi\":\"10.1109/ICEC.1994.349928\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We explore the distributed file and task placement problem, which is intractable. We also discuss genetic algorithms and how they have been used successfully to solve combinatorial problems. Our experimental results show the GA to be far superior to the greedy heuristic in obtaining optimal and near optimal file and task placements for the problem with various data sets.<<ETX>>\",\"PeriodicalId\":393865,\"journal\":{\"name\":\"Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICEC.1994.349928\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEC.1994.349928","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

我们探讨了分布式文件和任务放置问题，这是一个棘手的问题。我们还讨论了遗传算法以及它们是如何成功地用于解决组合问题的。我们的实验结果表明，对于具有各种数据集的问题，遗传算法在获得最优和接近最优的文件和任务放置方面远远优于贪婪启发式。

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

查看原文本刊更多论文

A genetic algorithm for file and task placement in a distributed system

We explore the distributed file and task placement problem, which is intractable. We also discuss genetic algorithms and how they have been used successfully to solve combinatorial problems. Our experimental results show the GA to be far superior to the greedy heuristic in obtaining optimal and near optimal file and task placements for the problem with various data sets.<>

求助全文

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

来源期刊

Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence

自引率

0.00%

发文量