{"title":"NSGA-II: CPU和GPU的实现和性能指标提取","authors":"Florina Roxana Padurariu, C. Marinescu","doi":"10.1109/SYNASC.2014.72","DOIUrl":null,"url":null,"abstract":"Multi-objective Optimization Evolutionary Algorithms are widely employed for solving different real-world optimization problems. Usually their runs involve a considerable amount of time because of the need to evaluate many functions. This particularity makes them good candidates of parallelization. In this work we investigate the benefits of the GPU implementation of the Non-dominated Sorting Genetic Algorithm II (NSGA-II) versus its CPU implementation in terms of the execution time.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"NSGA-II: Implementation and Performance Metrics Extraction for CPU and GPU\",\"authors\":\"Florina Roxana Padurariu, C. Marinescu\",\"doi\":\"10.1109/SYNASC.2014.72\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multi-objective Optimization Evolutionary Algorithms are widely employed for solving different real-world optimization problems. Usually their runs involve a considerable amount of time because of the need to evaluate many functions. This particularity makes them good candidates of parallelization. In this work we investigate the benefits of the GPU implementation of the Non-dominated Sorting Genetic Algorithm II (NSGA-II) versus its CPU implementation in terms of the execution time.\",\"PeriodicalId\":150575,\"journal\":{\"name\":\"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SYNASC.2014.72\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2014.72","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
NSGA-II: Implementation and Performance Metrics Extraction for CPU and GPU
Multi-objective Optimization Evolutionary Algorithms are widely employed for solving different real-world optimization problems. Usually their runs involve a considerable amount of time because of the need to evaluate many functions. This particularity makes them good candidates of parallelization. In this work we investigate the benefits of the GPU implementation of the Non-dominated Sorting Genetic Algorithm II (NSGA-II) versus its CPU implementation in terms of the execution time.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
