Optimal task assignment using a neural network

T. Tanaka, J. R. Canfield, S. Oyanagi, H. Genchi
{"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}
引用次数: 3

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.<>
基于神经网络的最优任务分配
只提供摘要形式。描述了一种神经网络,用于解决消息传递并行机中处理器任务的最优分配问题。这个任务分配问题(TAP)是通过创建一个任务分配代价函数来定义的,该函数表示通信开销和负载不平衡的代价。TAP是一种组合优化问题,利用神经网络可以有效地求解,但Hopfield - Tank方法有一定的局限性。作者利用改进的Hopfield模型网络解决了这两个问题。通过在神经网络中以更直接的方式表示TAP,消除了对约束的需求,保证了有效的解决方案,并且所需的神经元和连接数量大大减少。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信