{"title":"处理器调度的遗传算法","authors":"Jan Mendonça Corrêa, A. C. Melo","doi":"10.5753/wscad_estendido.2000.19138","DOIUrl":null,"url":null,"abstract":"ln its generic formulation, processor scheduling is a NP-Complete problem. Many different approaches have been proposed to the scheduling problem and one of them is the use of Genetic Algorithms (GA). These algorithms work using an analogy with living beings, mimicking their ability to adapt to the environment. The aim of this paper is to present a tentative of classification of GAbased processor schedulers and describe some of the results achieved and some aspects of GA that can interfere with the quality of the results.","PeriodicalId":146135,"journal":{"name":"Anais Estendidos do I Workshop em Sistemas Computacionais de Alto Desempenho (WSCAD Estendido 2000)","volume":"519 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Algoritmos Genéticos para Escalonamento de Processadores\",\"authors\":\"Jan Mendonça Corrêa, A. C. Melo\",\"doi\":\"10.5753/wscad_estendido.2000.19138\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"ln its generic formulation, processor scheduling is a NP-Complete problem. Many different approaches have been proposed to the scheduling problem and one of them is the use of Genetic Algorithms (GA). These algorithms work using an analogy with living beings, mimicking their ability to adapt to the environment. The aim of this paper is to present a tentative of classification of GAbased processor schedulers and describe some of the results achieved and some aspects of GA that can interfere with the quality of the results.\",\"PeriodicalId\":146135,\"journal\":{\"name\":\"Anais Estendidos do I Workshop em Sistemas Computacionais de Alto Desempenho (WSCAD Estendido 2000)\",\"volume\":\"519 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-10-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Anais Estendidos do I Workshop em Sistemas Computacionais de Alto Desempenho (WSCAD Estendido 2000)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5753/wscad_estendido.2000.19138\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Anais Estendidos do I Workshop em Sistemas Computacionais de Alto Desempenho (WSCAD Estendido 2000)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5753/wscad_estendido.2000.19138","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Algoritmos Genéticos para Escalonamento de Processadores
ln its generic formulation, processor scheduling is a NP-Complete problem. Many different approaches have been proposed to the scheduling problem and one of them is the use of Genetic Algorithms (GA). These algorithms work using an analogy with living beings, mimicking their ability to adapt to the environment. The aim of this paper is to present a tentative of classification of GAbased processor schedulers and describe some of the results achieved and some aspects of GA that can interfere with the quality of the results.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
