地理信息系统异构计算机网络中的负载分布

Mikhail Shirobokov, S. Sevryukov
{"title":"地理信息系统异构计算机网络中的负载分布","authors":"Mikhail Shirobokov, S. Sevryukov","doi":"10.1145/3274856.3274877","DOIUrl":null,"url":null,"abstract":"The problem of task scheduling is as old as grid computing and has been solved many times under different conditions. In this paper, we consider an algorithm for the task scheduling in the heterogeneous computer network of the geographical information system O-GIS, which includes dedicated data servers, central computing nodes, and end-user clients. Since some client devices in our network are also computing nodes, not only available computation power is considered as the influential factor, but also various network quality in incoming and outgoing communications of each node on computing grid. Using the specificity of raster computation, the original problem is formulated and its reducibility to the problem of mixed linear integer programming is shown. We also propose a method of deriving a feasible near-optimal solution without solving an NP-hard problem, which is used in O-GIS since we do not need an exact one as our network is not stable enough for the optimal solution to be significantly better in real-life cases.","PeriodicalId":373840,"journal":{"name":"Proceedings of the 3rd International Conference on Applications in Information Technology","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Load Distribution in the Heterogeneous Computer Network of the Geoinformation System\",\"authors\":\"Mikhail Shirobokov, S. Sevryukov\",\"doi\":\"10.1145/3274856.3274877\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of task scheduling is as old as grid computing and has been solved many times under different conditions. In this paper, we consider an algorithm for the task scheduling in the heterogeneous computer network of the geographical information system O-GIS, which includes dedicated data servers, central computing nodes, and end-user clients. Since some client devices in our network are also computing nodes, not only available computation power is considered as the influential factor, but also various network quality in incoming and outgoing communications of each node on computing grid. Using the specificity of raster computation, the original problem is formulated and its reducibility to the problem of mixed linear integer programming is shown. We also propose a method of deriving a feasible near-optimal solution without solving an NP-hard problem, which is used in O-GIS since we do not need an exact one as our network is not stable enough for the optimal solution to be significantly better in real-life cases.\",\"PeriodicalId\":373840,\"journal\":{\"name\":\"Proceedings of the 3rd International Conference on Applications in Information Technology\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 3rd International Conference on Applications in Information Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3274856.3274877\",\"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 the 3rd International Conference on Applications in Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3274856.3274877","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

任务调度问题与网格计算一样古老,已经在不同条件下得到了多次解决。本文研究了地理信息系统O-GIS异构计算机网络中的任务调度算法,该网络包括专用数据服务器、中心计算节点和终端用户客户端。由于我们网络中的一些客户端设备同时也是计算节点,因此影响因素不仅包括可用的计算能力,还包括计算网格中各节点进出通信的各种网络质量。利用栅格计算的特殊性,将原问题公式化,并证明其可约为混合线性整数规划问题。我们还提出了一种在不解决np困难问题的情况下推导可行的近最优解的方法,该方法在O-GIS中使用,因为我们的网络不够稳定,不需要精确的最优解,因此在现实情况下最优解明显更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Load Distribution in the Heterogeneous Computer Network of the Geoinformation System
The problem of task scheduling is as old as grid computing and has been solved many times under different conditions. In this paper, we consider an algorithm for the task scheduling in the heterogeneous computer network of the geographical information system O-GIS, which includes dedicated data servers, central computing nodes, and end-user clients. Since some client devices in our network are also computing nodes, not only available computation power is considered as the influential factor, but also various network quality in incoming and outgoing communications of each node on computing grid. Using the specificity of raster computation, the original problem is formulated and its reducibility to the problem of mixed linear integer programming is shown. We also propose a method of deriving a feasible near-optimal solution without solving an NP-hard problem, which is used in O-GIS since we do not need an exact one as our network is not stable enough for the optimal solution to be significantly better in real-life cases.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信