{"title":"性能驱动的MCM分区通过自适应遗传算法","authors":"S. Raman, L. Patnaik","doi":"10.1109/ASIC.1995.580701","DOIUrl":null,"url":null,"abstract":"We present a novel genetic algorithm-based partitioning scheme for Multi-Chip Modules (MCMs) which integrates four performance constraints simultaneously: pin count, area, heat dissipation and timing. Experimental studies demonstrate the superiority of this method over deterministic Fiduccia Mattheyes (FM) algorithm and simulated annealing (SA) technique. The algorithm performs better than another such algorithm recently reported. The adaptive change of crossover and mutation probabilities results in better convergence.","PeriodicalId":307095,"journal":{"name":"Proceedings of Eighth International Application Specific Integrated Circuits Conference","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Performance-driven MCM partitioning through an adaptive genetic algorithm\",\"authors\":\"S. Raman, L. Patnaik\",\"doi\":\"10.1109/ASIC.1995.580701\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a novel genetic algorithm-based partitioning scheme for Multi-Chip Modules (MCMs) which integrates four performance constraints simultaneously: pin count, area, heat dissipation and timing. Experimental studies demonstrate the superiority of this method over deterministic Fiduccia Mattheyes (FM) algorithm and simulated annealing (SA) technique. The algorithm performs better than another such algorithm recently reported. The adaptive change of crossover and mutation probabilities results in better convergence.\",\"PeriodicalId\":307095,\"journal\":{\"name\":\"Proceedings of Eighth International Application Specific Integrated Circuits Conference\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-09-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of Eighth International Application Specific Integrated Circuits Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ASIC.1995.580701\",\"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 Eighth International Application Specific Integrated Circuits Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ASIC.1995.580701","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Performance-driven MCM partitioning through an adaptive genetic algorithm
We present a novel genetic algorithm-based partitioning scheme for Multi-Chip Modules (MCMs) which integrates four performance constraints simultaneously: pin count, area, heat dissipation and timing. Experimental studies demonstrate the superiority of this method over deterministic Fiduccia Mattheyes (FM) algorithm and simulated annealing (SA) technique. The algorithm performs better than another such algorithm recently reported. The adaptive change of crossover and mutation probabilities results in better convergence.