一种基于分布式随机漫步算法的处理时间自动计算方法

Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings. Pub Date : 2003-10-13 DOI:10.1109/ISPDC.2003.1267640

Thibault Bernard, A. Bui, M. Bui, D. Sohier

{"title":"一种基于分布式随机漫步算法的处理时间自动计算方法","authors":"Thibault Bernard, A. Bui, M. Bui, D. Sohier","doi":"10.1109/ISPDC.2003.1267640","DOIUrl":null,"url":null,"abstract":"Random walks constitute an attractive technique in distributed computing. In this paper, we present an original method using relationship between electrical resistance and random walks, to automatically compute quantities such as cover time, and more generally any processing time measure defined through hitting times. This method comes from electrical theory by using Millman's theorem.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"A new method to automatically compute processing times for random walks based distributed algorithms\",\"authors\":\"Thibault Bernard, A. Bui, M. Bui, D. Sohier\",\"doi\":\"10.1109/ISPDC.2003.1267640\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Random walks constitute an attractive technique in distributed computing. In this paper, we present an original method using relationship between electrical resistance and random walks, to automatically compute quantities such as cover time, and more generally any processing time measure defined through hitting times. This method comes from electrical theory by using Millman's theorem.\",\"PeriodicalId\":368813,\"journal\":{\"name\":\"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.\",\"volume\":\"55 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-10-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPDC.2003.1267640\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPDC.2003.1267640","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 13

摘要

在分布式计算中，随机漫步是一种很有吸引力的技术。在本文中，我们提出了一种新颖的方法，利用电阻和随机游动之间的关系，自动计算覆盖时间等数量，以及更一般地通过命中次数定义的任何处理时间度量。该方法来源于电学理论，利用米尔曼定理。

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

查看原文本刊更多论文

A new method to automatically compute processing times for random walks based distributed algorithms

Random walks constitute an attractive technique in distributed computing. In this paper, we present an original method using relationship between electrical resistance and random walks, to automatically compute quantities such as cover time, and more generally any processing time measure defined through hitting times. This method comes from electrical theory by using Millman's theorem.

求助全文

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

来源期刊

Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.

自引率

0.00%

发文量