星型拓扑下的分布式程序可靠性分析

Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250) Pub Date : 1998-12-14 DOI:10.1109/ICPADS.1998.741025

M. Chang, Deng-Jyi Chen, Min-Sheng Lin, K. Ku

{"title":"星型拓扑下的分布式程序可靠性分析","authors":"M. Chang, Deng-Jyi Chen, Min-Sheng Lin, K. Ku","doi":"10.1109/ICPADS.1998.741025","DOIUrl":null,"url":null,"abstract":"We show that computing distributed program reliability on the star distributed computing system is NP-hard. We develop a polynomially solvable case to compute distributed program reliability when some additional file distribution is restricted on the star topology. We also propose a polynomial time algorithm for computing distributed program reliability with an approximate solution when the star topology is not satisfied with the additional file distribution.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"25","resultStr":"{\"title\":\"The distributed program reliability analysis on star topologies\",\"authors\":\"M. Chang, Deng-Jyi Chen, Min-Sheng Lin, K. Ku\",\"doi\":\"10.1109/ICPADS.1998.741025\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We show that computing distributed program reliability on the star distributed computing system is NP-hard. We develop a polynomially solvable case to compute distributed program reliability when some additional file distribution is restricted on the star topology. We also propose a polynomial time algorithm for computing distributed program reliability with an approximate solution when the star topology is not satisfied with the additional file distribution.\",\"PeriodicalId\":226947,\"journal\":{\"name\":\"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-12-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"25\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPADS.1998.741025\",\"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 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPADS.1998.741025","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 25

摘要

我们证明了星型分布式计算系统上计算分布式程序的可靠性是np困难的。我们提出了一个多项式可解的情况，用于计算一些附加文件分布在星型拓扑结构上的分布式程序可靠性。我们还提出了一种计算分布式程序可靠性的多项式时间算法，该算法在星型拓扑不满足附加文件分布时具有近似解。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

The distributed program reliability analysis on star topologies

We show that computing distributed program reliability on the star distributed computing system is NP-hard. We develop a polynomially solvable case to compute distributed program reliability when some additional file distribution is restricted on the star topology. We also propose a polynomial time algorithm for computing distributed program reliability with an approximate solution when the star topology is not satisfied with the additional file distribution.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)

自引率

0.00%

发文量