在一组固定的并行计算机上为具有最大代码密度的程序构建执行计划

{"title":"在一组固定的并行计算机上为具有最大代码密度的程序构建执行计划","authors":"V. Bakanov","doi":"10.21685/2072-3059-2023-1-2","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":33992,"journal":{"name":"Izvestiia vysshikh uchebnykh zavedenii Povolzhskii regionTekhnicheskie nauki","volume":"85 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Building execution plans for programs with maximum code density on a fixed set of parallel computers\",\"authors\":\"V. Bakanov\",\"doi\":\"10.21685/2072-3059-2023-1-2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":33992,\"journal\":{\"name\":\"Izvestiia vysshikh uchebnykh zavedenii Povolzhskii regionTekhnicheskie nauki\",\"volume\":\"85 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Izvestiia vysshikh uchebnykh zavedenii Povolzhskii regionTekhnicheskie nauki\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.21685/2072-3059-2023-1-2\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Izvestiia vysshikh uchebnykh zavedenii Povolzhskii regionTekhnicheskie nauki","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21685/2072-3059-2023-1-2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}