{"title":"基于神经网络的最优任务分配","authors":"T. Tanaka, J. R. Canfield, S. Oyanagi, H. Genchi","doi":"10.1109/IJCNN.1989.118372","DOIUrl":null,"url":null,"abstract":"Summary form only given. A neural network is described that solves the problem of optimally assigning tasks to processors in a message-passing parallel machine. This task assignment problem (TAP) is defined by creating a task assignment cost function that expresses the cost of communication overhead and load imbalance. TAP is a kind of combinatorial optimization problem which can be solved efficiently by using a neural network, but the Hopfield and Tank approach has certain limitations. The authors have solved these two problems by use of an improved Hopfield model network. By representing TAP in a more direct manner in the neural network, the need for constraints is eliminated, a valid solution is guaranteed, and the number of neurons and connections needed is reduced substantially.<<ETX>>","PeriodicalId":199877,"journal":{"name":"International 1989 Joint Conference on Neural Networks","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Optimal task assignment using a neural network\",\"authors\":\"T. Tanaka, J. R. Canfield, S. Oyanagi, H. Genchi\",\"doi\":\"10.1109/IJCNN.1989.118372\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Summary form only given. A neural network is described that solves the problem of optimally assigning tasks to processors in a message-passing parallel machine. This task assignment problem (TAP) is defined by creating a task assignment cost function that expresses the cost of communication overhead and load imbalance. TAP is a kind of combinatorial optimization problem which can be solved efficiently by using a neural network, but the Hopfield and Tank approach has certain limitations. The authors have solved these two problems by use of an improved Hopfield model network. By representing TAP in a more direct manner in the neural network, the need for constraints is eliminated, a valid solution is guaranteed, and the number of neurons and connections needed is reduced substantially.<<ETX>>\",\"PeriodicalId\":199877,\"journal\":{\"name\":\"International 1989 Joint Conference on Neural Networks\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International 1989 Joint Conference on Neural Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IJCNN.1989.118372\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International 1989 Joint Conference on Neural Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IJCNN.1989.118372","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Summary form only given. A neural network is described that solves the problem of optimally assigning tasks to processors in a message-passing parallel machine. This task assignment problem (TAP) is defined by creating a task assignment cost function that expresses the cost of communication overhead and load imbalance. TAP is a kind of combinatorial optimization problem which can be solved efficiently by using a neural network, but the Hopfield and Tank approach has certain limitations. The authors have solved these two problems by use of an improved Hopfield model network. By representing TAP in a more direct manner in the neural network, the need for constraints is eliminated, a valid solution is guaranteed, and the number of neurons and connections needed is reduced substantially.<>