{"title":"计算机集群优化问题的建模与应用","authors":"O. Pichugina","doi":"10.1109/KhPIWeek51551.2020.9250145","DOIUrl":null,"url":null,"abstract":"A decision-making problem of reasonability of upgrading a computer network by adding new connections between nodes is investigated. As a basic topology, a well-known hypercube topology is chosen. The expediency of its upgrading by links corresponding to edge sets of hypercube cuts by parallel hyperplanes is investigated. It is done by graph-theoretic approaches and tolls of polyhedral combinatorics. In the course of solving the problem, key structural characteristics of a new graph Q'n, which is a complemented by edges the hypercube graph, are studied. The offered methodology can be applied to other problems of optimization of computer networks, aiming to improve their reliability and efficiency.","PeriodicalId":115140,"journal":{"name":"2020 IEEE KhPI Week on Advanced Technology (KhPIWeek)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On Modelling of Computer Cluster Optimization Problem With Applications\",\"authors\":\"O. Pichugina\",\"doi\":\"10.1109/KhPIWeek51551.2020.9250145\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A decision-making problem of reasonability of upgrading a computer network by adding new connections between nodes is investigated. As a basic topology, a well-known hypercube topology is chosen. The expediency of its upgrading by links corresponding to edge sets of hypercube cuts by parallel hyperplanes is investigated. It is done by graph-theoretic approaches and tolls of polyhedral combinatorics. In the course of solving the problem, key structural characteristics of a new graph Q'n, which is a complemented by edges the hypercube graph, are studied. The offered methodology can be applied to other problems of optimization of computer networks, aiming to improve their reliability and efficiency.\",\"PeriodicalId\":115140,\"journal\":{\"name\":\"2020 IEEE KhPI Week on Advanced Technology (KhPIWeek)\",\"volume\":\"68 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-10-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE KhPI Week on Advanced Technology (KhPIWeek)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/KhPIWeek51551.2020.9250145\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE KhPI Week on Advanced Technology (KhPIWeek)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KhPIWeek51551.2020.9250145","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On Modelling of Computer Cluster Optimization Problem With Applications
A decision-making problem of reasonability of upgrading a computer network by adding new connections between nodes is investigated. As a basic topology, a well-known hypercube topology is chosen. The expediency of its upgrading by links corresponding to edge sets of hypercube cuts by parallel hyperplanes is investigated. It is done by graph-theoretic approaches and tolls of polyhedral combinatorics. In the course of solving the problem, key structural characteristics of a new graph Q'n, which is a complemented by edges the hypercube graph, are studied. The offered methodology can be applied to other problems of optimization of computer networks, aiming to improve their reliability and efficiency.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
