Placement of Data Array Replicas in a Distributed System With Unreliable Communication Channels

IF 0.5 Q4 COMPUTER SCIENCE, THEORY & METHODS Applied Computer Systems Pub Date : 2019-05-01 DOI:10.2478/acss-2019-0009
V. Kulba, S. Somov, Y. Merkuryev
{"title":"Placement of Data Array Replicas in a Distributed System With Unreliable Communication Channels","authors":"V. Kulba, S. Somov, Y. Merkuryev","doi":"10.2478/acss-2019-0009","DOIUrl":null,"url":null,"abstract":"Abstract The paper proposes an approach to solving the problem of optimal placement of data array replicas in a distributed system. It presents a formal model of a distributed system with unreliable communication channels. A system is represented as a graph with coloured arcs. The formulation of the problem of finding the optimal placement of replicas is given. As a criterion for optimization, the minimum response time to a data request is considered. The task solution heuristic algorithm is also proposed in the paper.","PeriodicalId":41960,"journal":{"name":"Applied Computer Systems","volume":null,"pages":null},"PeriodicalIF":0.5000,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Computer Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/acss-2019-0009","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 1

Abstract

Abstract The paper proposes an approach to solving the problem of optimal placement of data array replicas in a distributed system. It presents a formal model of a distributed system with unreliable communication channels. A system is represented as a graph with coloured arcs. The formulation of the problem of finding the optimal placement of replicas is given. As a criterion for optimization, the minimum response time to a data request is considered. The task solution heuristic algorithm is also proposed in the paper.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有不可靠通信通道的分布式系统中数据阵列副本的放置
摘要提出了一种解决分布式系统中数据阵列副本最优放置问题的方法。提出了一个具有不可靠通信通道的分布式系统的形式化模型。系统用带彩色弧线的图形表示。给出了寻找副本最优位置问题的公式。作为优化的标准,考虑了对数据请求的最小响应时间。本文还提出了任务解启发式算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Applied Computer Systems
Applied Computer Systems COMPUTER SCIENCE, THEORY & METHODS-
自引率
10.00%
发文量
9
审稿时长
30 weeks
期刊最新文献
Multimodal Biometric System Based on the Fusion in Score of Fingerprint and Online Handwritten Signature Multichannel Approach for Sentiment Analysis Using Stack of Neural Network with Lexicon Based Padding and Attention Mechanism BRS-based Model for the Specification of Multi-view Point Ontology Empirical Analysis of Supervised and Unsupervised Machine Learning Algorithms with Aspect-Based Sentiment Analysis Approximate Nearest Neighbour-based Index Tree: A Case Study for Instrumental Music Search
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1